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 21, 2026 18:57Jacob McDanielJacob McDanielScore: 2,602Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 18:582,45318,583,6784,935,0001,199,0002,117,632
2May 21, 2026 18:582,55818,709,7415,126,0001,271,0002,117,632
3May 21, 2026 18:582,56615,781,0245,152,0001,264,0002,117,632
4May 21, 2026 18:582,57916,895,8065,171,0001,277,0002,117,632
5May 21, 2026 18:582,60217,992,9915,226,0001,279,0002,117,632
6May 21, 2026 18:582,60417,923,6745,250,0001,262,0002,117,632
7May 21, 2026 18:582,62816,618,2065,306,0001,264,0002,117,632
8May 21, 2026 18:582,64616,793,8065,333,0001,282,0002,117,632
9May 21, 2026 18:582,65317,838,3625,339,0001,294,0002,117,632