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 09:36Victor MerckléVictor MerckléScore: 2,595Success
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 09:382,53114,118,6174,998,0001,330,0002,113,536
2May 30, 2026 09:382,53416,120,3495,005,0001,330,0002,113,536
3May 30, 2026 09:382,56715,913,6965,083,0001,335,0002,113,536
4May 30, 2026 09:382,58215,289,1545,097,0001,360,0002,113,536
5May 30, 2026 09:382,59515,813,1385,122,0001,366,0002,113,536
6May 30, 2026 09:382,61214,522,0755,210,0001,320,0002,113,536
7May 30, 2026 09:382,62314,653,9375,233,0001,325,0002,113,536
8May 30, 2026 09:382,62514,348,3705,237,0001,327,0002,113,536
9May 30, 2026 09:382,69614,945,2524,466,0002,276,0002,113,536