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:46Victor MerckléVictor MerckléScore: 2,861Success
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:482,73814,690,3985,606,0001,240,0002,113,536
2May 20, 2026 13:482,74015,851,8455,612,0001,240,0002,113,536
3May 20, 2026 13:482,77315,479,5655,687,0001,247,0002,113,536
4May 20, 2026 13:482,82315,873,9235,812,0001,247,0002,113,536
5May 20, 2026 13:482,86117,777,0335,915,0001,239,0002,113,536
6May 20, 2026 13:482,86214,902,9905,918,0001,238,0002,113,536
7May 20, 2026 13:482,89017,828,0865,972,0001,254,0002,113,536
8May 20, 2026 13:482,89516,663,1165,062,0002,177,0002,113,536
9May 20, 2026 13:482,89915,012,9805,992,0001,257,0002,113,536