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:34Victor MerckléVictor MerckléScore: 2,815Success
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:362,71415,403,4475,439,0001,346,0002,113,536
2May 20, 2026 16:362,71614,641,6005,446,0001,346,0002,113,536
3May 20, 2026 16:362,72615,864,7405,462,0001,354,0002,113,536
4May 20, 2026 16:362,79514,791,9255,643,0001,345,0002,113,536
5May 20, 2026 16:362,81514,792,4435,668,0001,370,0002,113,536
6May 20, 2026 16:362,84217,153,4005,759,0001,346,0002,113,536
7May 20, 2026 16:362,84616,495,0815,771,0001,346,0002,113,536
8May 20, 2026 16:362,84816,715,7105,776,0001,344,0002,113,536
9May 20, 2026 16:362,90216,568,4534,918,0002,339,0002,113,536