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 14:18Victor MerckléVictor MerckléScore: 2,828Success
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 14:202,68914,614,0855,386,0001,338,0002,113,536
2May 20, 2026 14:202,69116,491,8735,392,0001,337,0002,113,536
3May 20, 2026 14:202,70516,893,8625,414,0001,349,0002,113,536
4May 20, 2026 14:202,74614,677,2165,505,0001,362,0002,113,536
5May 20, 2026 14:202,82817,423,9165,736,0001,335,0002,113,536
6May 20, 2026 14:202,83614,904,7875,748,0001,342,0002,113,536
7May 20, 2026 14:202,83615,301,0165,754,0001,338,0002,113,536
8May 20, 2026 14:202,86115,016,4274,851,0002,303,0002,113,536
9May 20, 2026 14:202,86415,404,8325,806,0001,354,0002,113,536