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 15:23Victor MerckléVictor MerckléScore: 2,730Success
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 15:282,70114,535,5165,407,0001,346,0002,113,536
2May 20, 2026 15:282,70714,595,9965,422,0001,346,0002,113,536
3May 20, 2026 15:282,71614,542,2105,444,0001,348,0002,113,536
4May 20, 2026 15:282,72116,125,8285,454,0001,349,0002,113,536
5May 20, 2026 15:282,73016,101,2435,472,0001,354,0002,113,536
6May 20, 2026 15:282,81517,855,8934,703,0002,335,0002,113,536
7May 20, 2026 15:282,83415,762,0725,743,0001,344,0002,113,536
8May 20, 2026 15:282,84016,090,2115,760,0001,342,0002,113,536
9May 20, 2026 15:282,86115,595,5275,806,0001,348,0002,113,536