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 1, 2026 12:37Victor MerckléVictor MerckléError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 22:53Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 00:11020,932,0567,802,0003,375,0002,134,016pos 18: expected 0 got 255
2Sep 5, 2026 00:11020,815,4416,848,0004,222,0002,183,168pos 18: expected 0 got 255
3Sep 5, 2026 00:11021,808,9978,327,0003,595,0002,134,016pos 206: expected 0 got 255
4May 1, 2026 12:394,53927,528,5147,222,0004,127,0002,416,640
5May 1, 2026 12:394,74019,957,1755,926,0005,926,0002,375,680
6May 1, 2026 12:394,88120,293,3745,085,0007,119,0002,461,696
7May 1, 2026 12:394,90120,401,7456,127,0006,127,0002,564,096
8May 1, 2026 12:394,90820,287,4967,159,0005,113,0002,519,040
9May 1, 2026 12:394,96420,405,1386,205,0006,205,0002,338,816
10May 1, 2026 12:394,97320,522,7807,253,0005,180,0002,338,816
11May 1, 2026 12:394,97420,563,7957,254,0005,181,0002,400,256
12May 1, 2026 12:395,07220,728,72610,569,0002,113,0002,564,096