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 30, 2026 03:17Victor MerckléVictor MerckléScore: 2,531Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 03:192,52115,523,0544,974,0001,329,0002,113,536
2May 30, 2026 03:192,52814,751,8494,987,0001,333,0002,113,536
3May 30, 2026 03:192,53014,332,9624,991,0001,336,0002,113,536
4May 30, 2026 03:192,53113,914,7914,994,0001,335,0002,113,536
5May 30, 2026 03:192,53116,201,7014,994,0001,335,0002,113,536
6May 30, 2026 03:192,55214,328,3425,033,0001,349,0002,113,536
7May 30, 2026 03:192,55519,247,9285,039,0001,349,0002,113,536
8May 30, 2026 03:192,56315,915,3645,053,0001,355,0002,113,536
9May 30, 2026 03:192,62614,470,4675,233,0001,333,0002,113,536