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 14, 2026 10:50Victor MerckléVictor MerckléError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 22:47Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 23:42013,725,3113,407,0001,244,0002,113,536pos 32: expected 0 got 255
2Sep 4, 2026 23:42013,800,8653,418,0001,264,0002,113,536pos 221118: expected 1 got 2
3Jun 14, 2026 10:501,72211,819,6863,080,0001,227,0002,113,536
4Jun 14, 2026 10:501,72812,048,1233,097,0001,224,0002,113,536
5Jun 14, 2026 10:501,82312,224,8373,306,0001,252,0002,113,536
6Jun 14, 2026 10:501,83912,582,4253,367,0001,231,0002,113,536
7Jun 14, 2026 10:501,83912,247,7193,349,0001,249,0002,113,536
8Jun 14, 2026 10:501,85912,617,6953,416,0001,233,0002,113,536
9Sep 4, 2026 23:421,86013,848,9063,413,0001,239,0002,113,536
10Jun 14, 2026 10:501,87412,683,1163,130,0001,555,0002,113,536
11Jun 14, 2026 10:501,88312,711,9463,458,0001,251,0002,113,536
12Jun 14, 2026 10:501,89512,682,8423,470,0001,269,0002,113,536