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 listMay 20, 2026 16:24M-RochatM-RochatScore: 4,688Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 16:244,55320,713,88510,295,0001,088,0002,117,632
2May 20, 2026 16:244,55721,264,12210,305,0001,089,0002,117,632
3May 20, 2026 16:244,67721,558,04210,595,0001,099,0002,117,632
4May 20, 2026 16:244,68621,332,93110,618,0001,098,0002,113,536
5May 20, 2026 16:244,68820,928,98210,622,0001,098,0002,121,728
6May 20, 2026 16:244,69221,569,61010,631,0001,099,0002,117,632
7May 20, 2026 16:244,69421,618,07310,637,0001,098,0002,117,632
8May 20, 2026 16:244,71121,631,63910,674,0001,105,0002,121,728
9May 20, 2026 16:244,73421,104,0539,772,0002,063,0002,117,632