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 listJun 10, 2026 05:18Victor MerckléVictor MerckléError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 12:13Tomislav Tunkovic52.30CustomSolution Broken
Sep 5, 2026 01:21Tomislav Tunkovic10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 12:17015,234,9194,572,0002,218,0002,113,536pos 42: expected 0 got 255
2Sep 9, 2026 12:17015,082,7814,281,0002,324,0002,113,536pos 32: expected 0 got 255
3Sep 9, 2026 12:17015,452,5884,257,0002,717,0002,113,536pos 8: expected 0 got 255
4Jun 10, 2026 05:272,67414,164,0984,273,0002,413,0002,113,536
5Jun 10, 2026 05:272,70214,229,5734,595,0002,160,0002,113,536
6Jun 10, 2026 05:272,75014,343,1914,575,0002,300,0002,113,536
7Jun 10, 2026 05:272,75214,316,3624,715,0002,165,0002,113,536
8Jun 10, 2026 05:272,77214,432,8754,572,0002,360,0002,113,536
9Jun 10, 2026 05:272,79414,481,0774,658,0002,329,0002,113,536
10Jun 10, 2026 05:272,79614,592,5594,429,0002,561,0002,113,536
11Jun 10, 2026 05:272,80514,478,6764,434,0002,580,0002,113,536
12Jun 10, 2026 05:272,81214,506,5554,476,0002,555,0002,113,536