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 10, 2026 09:28Victor MerckléVictor MerckléScore: 2,465Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 09:292,41014,786,3163,800,0002,227,0002,146,304stderr
2Sep 10, 2026 09:292,42114,807,2863,804,0002,249,0002,146,304stderr
3Sep 10, 2026 09:292,46014,744,6313,932,0002,219,0002,146,304stderr
4Sep 10, 2026 09:292,46214,771,4773,956,0002,201,0002,146,304stderr
5Sep 10, 2026 09:292,46514,825,2763,939,0002,224,0002,146,304stderr
6Sep 10, 2026 09:292,47514,803,7903,928,0002,261,0002,146,304stderr
7Sep 10, 2026 09:292,48115,343,1413,743,0002,461,0002,146,304stderr
8Sep 10, 2026 09:292,48714,901,9603,708,0002,510,0002,146,304stderr
9Sep 10, 2026 09:292,56315,057,0854,063,0002,345,0002,146,304stderr