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:21Victor MerckléVictor MerckléError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 12:04Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 12:05016,608,8954,353,0002,365,0002,142,208pos 34: expected 0 got 255stderr
2Sep 9, 2026 12:05016,885,8464,495,0002,349,0002,146,304pos 102: expected 0 got 255stderr
3Sep 9, 2026 12:05016,651,8794,359,0002,381,0002,142,208pos 878: expected 0 got 255stderr
4Aug 30, 2026 20:252,32515,780,1044,253,0001,560,0002,203,648stderr
5Aug 30, 2026 20:252,61016,232,5933,591,0002,935,0002,199,552stderr
6Aug 30, 2026 20:252,62016,377,9844,239,0002,311,0002,142,208stderr
7Aug 30, 2026 20:252,63216,430,7223,610,0002,971,0002,207,744stderr
8Aug 30, 2026 20:252,63516,395,5134,256,0002,333,0002,187,264stderr
9Aug 30, 2026 20:252,64316,437,3604,256,0002,352,0002,166,784stderr
10Aug 30, 2026 20:252,68916,548,0664,315,0002,408,0002,146,304stderr
11Aug 30, 2026 20:252,70816,661,4853,753,0003,017,0002,207,744stderr
12Aug 30, 2026 20:252,71416,561,9083,767,0003,019,0002,203,648stderr