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 29, 2026 19:08Victor MerckléVictor MerckléScore: 2,637Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 19:102,55814,756,5595,090,0001,307,0002,113,536
2May 29, 2026 19:102,56714,421,6775,103,0001,315,0002,113,536
3May 29, 2026 19:102,57415,692,7675,124,0001,312,0002,113,536
4May 29, 2026 19:102,57616,440,8235,124,0001,316,0002,113,536
5May 29, 2026 19:102,63716,714,4985,250,0001,344,0002,113,536
6May 29, 2026 19:102,63914,464,9315,283,0001,315,0002,113,536
7May 29, 2026 19:102,71015,832,0005,472,0001,305,0002,113,536
8May 29, 2026 19:102,71814,475,3865,471,0001,325,0002,113,536
9May 29, 2026 19:102,73914,663,0935,519,0001,329,0002,113,536