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 listJun 9, 2026 23:47Victor MerckléVictor MerckléError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 12:24Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 12:25019,406,3196,320,0003,150,0002,129,920pos 34: expected 0 got 255
2Sep 9, 2026 12:25019,106,9796,248,0002,986,0002,129,920pos 32: expected 0 got 255
3Sep 9, 2026 12:25019,264,0256,378,0002,982,0002,138,112pos 34: expected 0 got 255
4Jun 9, 2026 23:513,49517,733,5866,290,0002,449,0002,138,112
5Jun 9, 2026 23:513,53417,693,1646,362,0002,473,0002,129,920
6Jun 9, 2026 23:513,55817,771,2266,428,0002,467,0002,138,112
7Jun 9, 2026 23:513,57417,999,0146,458,0002,479,0002,134,016
8Jun 9, 2026 23:513,61217,953,6886,527,0002,505,0002,138,112
9Jun 9, 2026 23:513,62417,942,4806,580,0002,482,0002,138,112
10Jun 9, 2026 23:513,62717,987,5606,216,0002,853,0002,138,112
11Jun 9, 2026 23:513,70818,245,2996,423,0002,848,0002,138,112
12Jun 9, 2026 23:513,80318,401,5876,356,0003,153,0002,129,920