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 20, 2026 13:12Victor MerckléVictor MerckléScore: 2,832Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 13:142,72115,140,1685,666,0001,138,0002,113,536
2May 20, 2026 13:142,74815,896,5905,720,0001,151,0002,113,536
3May 20, 2026 13:142,77715,200,7165,803,0001,141,0002,113,536
4May 20, 2026 13:142,83214,836,7655,943,0001,138,0002,113,536
5May 20, 2026 13:142,83216,539,6455,943,0001,139,0002,113,536
6May 20, 2026 13:142,84117,193,7975,962,0001,141,0002,113,536
7May 20, 2026 13:142,85215,314,8925,992,0001,139,0002,113,536
8May 20, 2026 13:142,86117,182,4276,010,0001,143,0002,113,536
9May 20, 2026 13:142,91016,023,1275,264,0002,013,0002,113,536