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 29, 2026 12:22Victor MerckléVictor MerckléScore: 2,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 12:242,59016,453,9675,145,0001,331,0002,113,536
2May 29, 2026 12:242,59414,305,5275,153,0001,334,0002,113,536
3May 29, 2026 12:242,61614,322,3715,218,0001,322,0002,113,536
4May 29, 2026 12:242,62014,527,8665,206,0001,344,0002,113,536
5May 29, 2026 12:242,68614,978,2605,401,0001,315,0002,113,536
6May 29, 2026 12:242,69815,255,9825,446,0001,299,0002,113,536
7May 29, 2026 12:242,69815,858,4695,428,0001,317,0002,113,536
8May 29, 2026 12:242,72316,714,4835,478,0001,330,0002,113,536
9May 29, 2026 12:242,75114,617,5284,622,0002,257,0002,113,536