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 listSep 14, 2026 01:00Andrew EpsteinAndrew EpsteinScore: 1,391Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 14, 2026 11:50Victor Mercklé10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 01:011,33711,752,5883,343,0000524,288
2Sep 14, 2026 01:011,33911,667,0603,349,0000524,288
3Sep 14, 2026 01:011,35411,858,2023,385,0000524,288
4Sep 14, 2026 01:011,35811,847,3613,395,0000524,288
5Sep 14, 2026 01:011,39111,921,5293,479,0000524,288
6Sep 14, 2026 01:011,39911,911,8053,498,0000524,288
7Sep 14, 2026 01:011,40211,903,7713,507,0000524,288
8Sep 14, 2026 01:011,40611,731,7773,516,0000524,288
9Sep 14, 2026 01:011,41011,643,4493,526,0000524,288