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 29, 2026 21:02Victor MerckléVictor MerckléScore: 2,616Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 21:042,54215,811,9095,027,0001,329,0002,113,536
2May 29, 2026 21:042,54517,104,0545,036,0001,327,0002,113,536
3May 29, 2026 21:042,55914,943,5465,067,0001,331,0002,113,536
4May 29, 2026 21:042,60316,243,4055,149,0001,360,0002,113,536
5May 29, 2026 21:042,61614,797,8885,216,0001,325,0002,113,536
6May 29, 2026 21:042,63016,468,1395,248,0001,328,0002,113,536
7May 29, 2026 21:042,63116,129,0605,253,0001,326,0002,113,536
8May 29, 2026 21:042,65714,793,0095,304,0001,340,0002,113,536
9May 29, 2026 21:042,67315,185,9625,337,0001,346,0002,113,536