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 06:39Victor MerckléVictor MerckléScore: 2,632Success
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 06:412,54014,174,6855,011,0001,339,0002,113,536
2May 30, 2026 06:412,54214,105,7655,019,0001,338,0002,113,536
3May 30, 2026 06:412,54415,832,6695,022,0001,340,0002,113,536
4May 30, 2026 06:412,60014,830,1534,229,0002,271,0002,113,536
5May 30, 2026 06:412,63215,838,4925,246,0001,335,0002,113,536
6May 30, 2026 06:412,63717,033,0115,261,0001,332,0002,113,536
7May 30, 2026 06:412,64816,557,2955,284,0001,338,0002,113,536
8May 30, 2026 06:412,69016,466,6594,451,0002,276,0002,113,536
9May 30, 2026 06:412,70815,052,6154,493,0002,279,0002,113,536