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 30, 2026 01:29Victor MerckléVictor MerckléScore: 2,556Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 01:312,53114,399,3325,000,0001,328,0002,113,536
2May 30, 2026 01:312,53414,622,6955,004,0001,331,0002,113,536
3May 30, 2026 01:312,53515,226,7425,008,0001,330,0002,113,536
4May 30, 2026 01:312,53514,694,6825,011,0001,327,0002,113,536
5May 30, 2026 01:312,55614,168,2175,046,0001,344,0002,113,536
6May 30, 2026 01:312,56016,166,1395,055,0001,347,0002,113,536
7May 30, 2026 01:312,59015,995,8115,111,0001,365,0002,113,536
8May 30, 2026 01:312,60414,381,1005,181,0001,329,0002,113,536
9May 30, 2026 01:312,60814,844,0725,191,0001,331,0002,113,536