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

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 03:06Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 04:35014,314,0553,568,0001,583,0002,146,304pos 98: expected 0 got 255stderr
2Aug 30, 2026 20:201,94815,296,7093,384,0001,487,0002,146,304stderr
3Aug 30, 2026 20:201,95215,400,6973,347,0001,534,0002,146,304stderr
4Aug 30, 2026 20:201,97415,598,9233,410,0001,525,0002,146,304stderr
5Aug 30, 2026 20:201,98015,768,4933,399,0001,551,0002,146,304stderr
6Aug 30, 2026 20:201,99416,805,6683,415,0001,570,0002,146,304stderr
7Aug 30, 2026 20:202,02015,675,2973,379,0001,673,0002,146,304stderr
8Aug 30, 2026 20:202,04115,710,9183,470,0001,634,0002,146,304stderr
9Aug 30, 2026 20:202,04415,704,8933,508,0001,604,0002,146,304stderr
10Sep 5, 2026 04:352,04713,644,8363,543,0001,576,0002,146,304stderr
11Sep 5, 2026 04:352,06214,393,8723,584,0001,572,0002,146,304stderr
12Aug 30, 2026 20:202,06815,380,6613,508,0001,664,0002,146,304stderr