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 03:47Victor MerckléVictor MerckléScore: 2,578Success
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 03:492,52814,057,3654,988,0001,332,0002,113,536
2May 30, 2026 03:492,52914,279,2874,989,0001,334,0002,113,536
3May 30, 2026 03:492,54614,852,8755,018,0001,347,0002,113,536
4May 30, 2026 03:492,54814,169,5995,023,0001,347,0002,113,536
5May 30, 2026 03:492,57814,260,1885,117,0001,330,0002,113,536
6May 30, 2026 03:492,61314,381,9135,207,0001,327,0002,113,536
7May 30, 2026 03:492,62414,143,7905,228,0001,333,0002,113,536
8May 30, 2026 03:492,63015,978,4485,245,0001,331,0002,113,536
9May 30, 2026 03:492,64116,100,1435,259,0001,345,0002,113,536