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 29, 2026 11:42Victor MerckléVictor MerckléScore: 2,738Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 11:432,67415,153,8735,332,0001,353,0002,113,536
2May 29, 2026 11:432,71214,629,2765,621,0001,159,0002,113,536
3May 29, 2026 11:432,72414,549,8395,474,0001,336,0002,113,536
4May 29, 2026 11:432,73816,144,7175,497,0001,350,0002,113,536
5May 29, 2026 11:432,73816,725,9895,503,0001,342,0002,113,536
6May 29, 2026 11:432,73914,615,5285,506,0001,342,0002,113,536
7May 29, 2026 11:432,74415,942,9415,523,0001,338,0002,113,536
8May 29, 2026 11:432,74515,055,0735,519,0001,344,0002,113,536
9May 29, 2026 11:432,75115,107,8405,538,0001,341,0002,113,536