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 05:07Victor MerckléVictor MerckléScore: 2,625Success
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 05:082,54716,720,9405,037,0001,331,0002,113,536
2May 30, 2026 05:082,55714,057,3005,042,0001,352,0002,113,536
3May 30, 2026 05:082,60414,291,0015,179,0001,333,0002,113,536
4May 30, 2026 05:082,62216,374,6205,208,0001,348,0002,113,536
5May 30, 2026 05:082,62515,722,9305,230,0001,334,0002,113,536
6May 30, 2026 05:082,63216,912,4225,245,0001,336,0002,113,536
7May 30, 2026 05:082,63315,679,2745,255,0001,329,0002,113,536
8May 30, 2026 05:082,63916,012,8775,266,0001,333,0002,113,536
9May 30, 2026 05:082,69516,434,0894,468,0002,271,0002,113,536