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 9, 2026 16:50Victor MerckléVictor MerckléScore: 4,298Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 16:544,27919,388,5369,478,0001,220,0002,121,728stderr
2Sep 9, 2026 16:544,29019,596,8979,494,0001,232,0002,121,728stderr
3Sep 9, 2026 16:544,29419,267,9639,503,0001,233,0002,121,728stderr
4Sep 9, 2026 16:544,29419,636,1569,498,0001,239,0002,121,728stderr
5Sep 9, 2026 16:544,29819,639,8309,393,0001,353,0002,121,728stderr
6Sep 9, 2026 16:544,29819,287,4209,505,0001,240,0002,121,728stderr
7Sep 9, 2026 16:544,30421,124,0689,409,0001,353,0002,121,728stderr
8Sep 9, 2026 16:544,30719,265,5839,517,0001,251,0002,121,728stderr
9Sep 9, 2026 16:544,30819,699,9259,514,0001,257,0002,121,728stderr