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 00:54Andrew EpsteinAndrew EpsteinScore: 1,407Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 15, 2026 07:25Victor Mercklé10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 00:551,28611,540,9643,217,0000524,288
2Sep 14, 2026 00:551,29411,660,9343,235,0000524,288
3Sep 14, 2026 00:551,37411,622,8313,437,0000524,288
4Sep 14, 2026 00:551,39011,944,7883,476,0000524,288
5Sep 14, 2026 00:551,40711,870,0913,519,0000524,288
6Sep 14, 2026 00:551,40711,884,4643,519,0000524,288
7Sep 14, 2026 00:551,40812,247,6673,522,0000524,288
8Sep 14, 2026 00:551,40911,945,0623,524,0000524,288
9Sep 14, 2026 00:551,41011,822,0353,527,0000524,288