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 04:22Victor MerckléVictor MerckléScore: 2,624Success
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 04:232,51916,220,1804,969,0001,329,0002,113,536
2May 30, 2026 04:232,61219,844,6675,168,0001,364,0002,113,536
3May 30, 2026 04:232,62015,689,1655,218,0001,332,0002,113,536
4May 30, 2026 04:232,62114,286,1435,219,0001,335,0002,113,536
5May 30, 2026 04:232,62414,565,4435,231,0001,331,0002,113,536
6May 30, 2026 04:232,63515,902,1705,253,0001,335,0002,113,536
7May 30, 2026 04:232,64314,172,0795,272,0001,336,0002,113,536
8May 30, 2026 04:232,66114,394,9954,379,0002,274,0002,113,536
9May 30, 2026 04:232,70515,565,5314,459,0002,305,0002,113,536