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

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 01:18Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 02:56012,224,2122,879,0001,118,0002,117,632pos 6: expected 115 got 114stderr
2Aug 30, 2026 20:151,46911,772,2782,611,0001,062,0002,117,632stderr
3Aug 30, 2026 20:151,47111,780,2062,613,0001,065,0002,117,632stderr
4Aug 30, 2026 20:151,47411,866,8142,621,0001,065,0002,117,632stderr
5Aug 30, 2026 20:151,47611,831,1712,624,0001,067,0002,117,632stderr
6Aug 30, 2026 20:151,47811,837,8612,620,0001,075,0002,117,632stderr
7Aug 30, 2026 20:151,47811,889,1832,621,0001,075,0002,117,632stderr
8Sep 5, 2026 02:561,48011,893,1822,635,0001,067,0002,117,632stderr
9Aug 30, 2026 20:151,52511,964,4222,616,0001,197,0002,117,632stderr
10Aug 30, 2026 20:151,52911,979,1792,620,0001,204,0002,117,632stderr
11Aug 30, 2026 20:151,54013,480,5082,591,0001,259,0002,117,632stderr
12Sep 5, 2026 02:561,60712,241,5172,894,0001,125,0002,117,632stderr