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 listAug 30, 2026 20:40Victor MerckléVictor MerckléError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 12:07Tomislav Tunkovic133.59CustomSolution Broken
Sep 4, 2026 22:52Tomislav Tunkovic10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 12:08013,065,8082,972,0001,375,0002,121,728pos 106: expected 0 got 255stderr
2Sep 9, 2026 12:08013,361,0333,149,0001,274,0002,121,728pos 42: expected 0 got 255stderr
3Sep 9, 2026 12:08012,962,0263,052,0001,397,0002,121,728pos 38: expected 0 got 255stderr
4Aug 30, 2026 20:431,65312,612,0403,041,0001,092,0002,121,728stderr
5Aug 30, 2026 20:431,67712,621,0682,906,0001,288,0002,121,728stderr
6Aug 30, 2026 20:431,68812,672,9813,082,0001,138,0002,121,728stderr
7Aug 30, 2026 20:431,71412,606,1392,907,0001,379,0002,121,728stderr
8Aug 30, 2026 20:431,73012,409,7913,165,0001,160,0002,121,728stderr
9Aug 30, 2026 20:431,73412,655,4992,918,0001,418,0002,121,728stderr
10Aug 30, 2026 20:431,76212,748,3573,243,0001,163,0002,121,728stderr
11Aug 30, 2026 20:431,78212,818,8313,157,0001,298,0002,121,728stderr
12Aug 30, 2026 20:431,82221,381,4323,221,0001,335,0002,121,728stderr