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 13:17Victor MerckléVictor MerckléScore: 2,822Success
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 13:182,77014,596,4695,580,0001,346,0002,113,536
2May 20, 2026 13:182,78414,738,7455,612,0001,350,0002,113,536
3May 20, 2026 13:182,79814,897,7665,649,0001,347,0002,113,536
4May 20, 2026 13:182,81516,319,0165,699,0001,339,0002,113,536
5May 20, 2026 13:182,82216,375,3835,717,0001,339,0002,113,536
6May 20, 2026 13:182,82416,763,9825,703,0001,358,0002,113,536
7May 20, 2026 13:182,90016,147,4125,910,0001,340,0002,113,536
8May 20, 2026 13:182,91815,357,1535,940,0001,357,0002,113,536
9May 20, 2026 13:182,93817,231,1766,013,0001,333,0002,113,536