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 29, 2026 17:51Victor MerckléVictor MerckléScore: 1,469Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 12:06Tomislav Tunkovic10.00CustomSolution Held
Sep 9, 2026 12:00Tomislav Tunkovic10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 15:371,45311,977,7202,557,0001,077,0002,117,632stderr
2Aug 30, 2026 15:371,46511,853,2502,596,0001,068,0002,117,632stderr
3Aug 30, 2026 15:371,46511,881,0952,582,0001,082,0002,117,632stderr
4Aug 30, 2026 15:371,46811,987,7002,591,0001,080,0002,117,632stderr
5Aug 30, 2026 15:371,46911,851,8182,604,0001,069,0002,117,632stderr
6Aug 30, 2026 15:371,49612,032,6452,641,0001,100,0002,117,632stderr
7Aug 30, 2026 15:371,52912,223,8912,717,0001,106,0002,117,632stderr
8Aug 30, 2026 15:371,57412,139,7022,806,0001,130,0002,117,632stderr
9Aug 30, 2026 15:371,59412,383,2312,879,0001,107,0002,117,632stderr