Large integer multiplication Bernard Teo

Multiply two large unsigned integers as fast as possible.

Input

Exactly 500,000 bytes on STDIN: two unsigned integers encoded back-to-back, each 250,000 bytes, in little-endian byte order.

Output

Write exactly 500,000 bytes to STDOUT containing the product in little-endian byte order.

Back to listNov 15, 2024 10:46Mikhail ShirokovMikhail ShirokovScore: 377,260Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 15, 2024 10:46377,228966,713,929942,070,0001,000,0002,424,832
2Nov 15, 2024 10:46377,260968,134,395941,151,0001,998,0002,293,760
3Nov 15, 2024 10:46377,301968,061,166941,255,0001,998,0002,293,760