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:40Victor MerckléVictor MerckléScore: 2,743Success
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:412,61814,346,4515,200,0001,347,0002,113,536
2May 29, 2026 11:412,68616,406,0805,333,0001,382,0002,113,536
3May 29, 2026 11:412,69415,740,8245,356,0001,381,0002,113,536
4May 29, 2026 11:412,70314,536,1875,380,0001,378,0002,113,536
5May 29, 2026 11:412,74317,642,3545,510,0001,349,0002,113,536
6May 29, 2026 11:412,75515,334,0565,535,0001,354,0002,113,536
7May 29, 2026 11:412,75614,752,8895,545,0001,345,0002,113,536
8May 29, 2026 11:412,76115,468,2315,562,0001,341,0002,113,536
9May 29, 2026 11:412,76916,012,5234,607,0002,317,0002,113,536