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 listSep 15, 2026 10:51Victor MerckléVictor MerckléScore: 1,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 10:511,35712,299,6171,858,0001,535,0002,117,632stderr
2Sep 15, 2026 10:511,37412,188,9061,892,0001,543,0002,117,632stderr
3Sep 15, 2026 10:511,38012,289,6261,897,0001,554,0002,117,632stderr
4Sep 15, 2026 10:511,41212,172,4911,943,0001,588,0002,117,632stderr
5Sep 15, 2026 10:511,47012,375,8642,103,0001,573,0002,117,632stderr
6Sep 15, 2026 10:511,47212,285,1842,542,0001,140,0002,117,632stderr
7Sep 15, 2026 10:511,47212,408,3792,099,0001,581,0002,117,632stderr
8Sep 15, 2026 10:511,48912,427,6342,155,0001,569,0002,117,632stderr
9Sep 15, 2026 10:511,50014,615,0872,596,0001,154,0002,117,632stderr