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 02:55Victor MerckléVictor MerckléScore: 2,759Success
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 02:572,68214,558,5725,398,0001,307,0002,113,536
2May 30, 2026 02:572,69716,940,6655,431,0001,313,0002,113,536
3May 30, 2026 02:572,70515,173,1385,449,0001,314,0002,113,536
4May 30, 2026 02:572,72017,603,4605,474,0001,326,0002,113,536
5May 30, 2026 02:572,75915,297,2144,639,0002,260,0002,113,536
6May 30, 2026 02:572,77315,422,6345,624,0001,309,0002,113,536
7May 30, 2026 02:572,77515,818,9105,627,0001,311,0002,113,536
8May 30, 2026 02:572,77716,900,1345,638,0001,305,0002,113,536
9May 30, 2026 02:572,80316,398,2725,686,0001,323,0002,113,536