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 14, 2026 10:06Victor MerckléVictor MerckléScore: 1,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 10:071,43712,219,8962,516,0001,078,0002,117,632stderr
2Sep 14, 2026 10:071,44712,335,7282,516,0001,103,0002,117,632stderr
3Sep 14, 2026 10:071,44912,387,1492,537,0001,087,0002,117,632stderr
4Sep 14, 2026 10:071,45112,273,8042,523,0001,106,0002,117,632stderr
5Sep 14, 2026 10:071,54512,462,6322,724,0001,139,0002,117,632stderr
6Sep 14, 2026 10:071,55112,615,3072,728,0001,150,0002,117,632stderr
7Sep 14, 2026 10:071,55313,186,1712,732,0001,151,0002,117,632stderr
8Sep 14, 2026 10:071,55512,579,1902,744,0001,145,0002,117,632stderr
9Sep 14, 2026 10:071,55912,599,2512,748,0001,150,0002,117,632stderr