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:53M-RochatM-RochatScore: 4,686Success
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:534,55420,737,44110,299,0001,088,0002,121,728
2May 20, 2026 16:534,55820,740,51210,308,0001,088,0002,121,728
3May 20, 2026 16:534,56120,732,51510,313,0001,091,0002,117,632
4May 20, 2026 16:534,68621,565,43710,617,0001,100,0002,117,632
5May 20, 2026 16:534,68621,020,61810,617,0001,098,0002,121,728
6May 20, 2026 16:534,69121,595,73610,628,0001,100,0002,117,632
7May 20, 2026 16:534,69221,498,17710,630,0001,101,0002,117,632
8May 20, 2026 16:534,69621,589,29810,643,0001,099,0002,117,632
9May 20, 2026 16:534,69921,621,31110,645,0001,104,0002,117,632