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 1, 2026 13:18Victor MerckléVictor MerckléScore: 23,998Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 13:2023,77777,164,65254,406,0005,037,0005,316,608
2May 1, 2026 13:2023,81668,022,65151,469,0008,073,0005,394,432
3May 1, 2026 13:2023,91468,254,82749,822,0009,964,0005,341,184
4May 1, 2026 13:2023,98479,646,46153,966,0005,996,0005,300,224
5May 1, 2026 13:2023,99868,460,10651,996,0007,999,0005,296,128
6May 1, 2026 13:2024,02768,818,75352,060,0008,009,0005,173,248
7May 1, 2026 13:2024,03468,635,84556,080,0004,005,0005,279,744
8May 1, 2026 13:2024,05068,593,05953,111,0007,014,0005,382,144
9May 1, 2026 13:2024,07668,719,96051,162,0009,028,0005,275,648