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 20, 2026 15:17Victor MerckléVictor MerckléScore: 2,782Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 15:222,70915,578,7605,637,0001,137,0002,113,536
2May 20, 2026 15:222,71714,591,8105,655,0001,138,0002,113,536
3May 20, 2026 15:222,72916,151,0155,685,0001,139,0002,113,536
4May 20, 2026 15:222,73016,822,7995,685,0001,140,0002,113,536
5May 20, 2026 15:222,78215,491,4625,791,0001,166,0002,113,536
6May 20, 2026 15:222,81916,801,2335,904,0001,144,0002,113,536
7May 20, 2026 15:222,82416,400,0375,919,0001,142,0002,113,536
8May 20, 2026 15:222,83815,740,7965,953,0001,143,0002,113,536
9May 20, 2026 15:222,86016,825,4355,995,0001,156,0002,113,536