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 listMay 11, 2026 20:27Victor MerckléVictor MerckléError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 03:08Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 04:35015,553,2685,935,0001,137,0002,113,536pos 34: expected 0 got 255
2Sep 5, 2026 04:35015,688,9415,966,0001,138,0002,113,536pos 34: expected 122 got 121
3May 11, 2026 20:282,82014,775,9245,917,0001,133,0002,113,536
4May 11, 2026 20:282,82415,515,1885,926,0001,134,0002,113,536
5Sep 5, 2026 04:352,82815,566,1235,715,0001,355,0002,113,536
6May 11, 2026 20:282,83315,576,4195,943,0001,140,0002,113,536
7May 11, 2026 20:282,85417,405,7365,990,0001,147,0002,113,536
8May 11, 2026 20:282,93317,564,6986,202,0001,132,0002,113,536
9May 11, 2026 20:282,93417,781,9536,201,0001,135,0002,113,536
10May 11, 2026 20:282,94815,508,0676,230,0001,142,0002,113,536
11May 11, 2026 20:282,95814,601,2156,256,0001,140,0002,113,536
12May 11, 2026 20:282,99017,325,7515,456,0002,021,0002,113,536