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 02:40Victor MerckléVictor MerckléScore: 2,546Success
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 02:412,53414,160,2925,002,0001,335,0002,113,536
2May 30, 2026 02:412,53614,186,4905,009,0001,333,0002,113,536
3May 30, 2026 02:412,54214,364,8235,016,0001,339,0002,113,536
4May 30, 2026 02:412,54415,226,8415,023,0001,337,0002,113,536
5May 30, 2026 02:412,54613,980,8355,030,0001,336,0002,113,536
6May 30, 2026 02:412,55515,485,7345,038,0001,351,0002,113,536
7May 30, 2026 02:412,63116,409,7275,240,0001,339,0002,113,536
8May 30, 2026 02:412,66215,366,6974,364,0002,291,0002,113,536
9May 30, 2026 02:412,66414,503,1245,306,0001,354,0002,113,536