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

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 12:00Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 12:03015,950,4743,316,0002,707,0002,195,456pos 254: expected 0 got 255stderr
2Sep 9, 2026 12:03016,132,1043,513,0002,710,0002,195,456pos 230: expected 0 got 255stderr
3Sep 9, 2026 12:03016,235,1983,293,0002,720,0002,142,208pos 98: expected 0 got 255stderr
4Aug 30, 2026 20:352,46016,048,8003,517,0002,634,0002,183,168stderr
5Aug 30, 2026 20:352,46316,269,2613,449,0002,709,0002,142,208stderr
6Aug 30, 2026 20:352,46716,500,4473,928,0002,240,0002,138,112stderr
7Aug 30, 2026 20:352,47215,923,5003,818,0002,364,0002,142,208stderr
8Aug 30, 2026 20:352,49215,996,9763,910,0002,322,0002,195,456stderr
9Aug 30, 2026 20:352,49615,966,9703,950,0002,292,0002,142,208stderr
10Aug 30, 2026 20:352,49815,962,9843,627,0002,618,0002,174,976stderr
11Aug 30, 2026 20:352,51616,437,8754,035,0002,255,0002,142,208stderr
12Aug 30, 2026 20:352,66616,449,2313,153,0003,512,0002,142,208stderr