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

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 01:39Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 03:26012,858,4033,120,0001,230,0002,113,536pos 28: expected 0 got 255
2Sep 5, 2026 03:261,71412,797,6613,074,0001,212,0002,113,536
3Sep 5, 2026 03:261,71512,877,2683,075,0001,213,0002,113,536
4Jun 14, 2026 11:481,72811,978,9913,102,0001,219,0002,113,536
5Jun 14, 2026 11:481,73012,034,6013,110,0001,216,0002,113,536
6Jun 14, 2026 11:481,73111,995,0323,112,0001,216,0002,113,536
7Jun 14, 2026 11:481,73212,192,7553,107,0001,224,0002,113,536
8Jun 14, 2026 11:481,73511,988,6733,116,0001,223,0002,113,536
9Jun 14, 2026 11:481,74012,010,1393,127,0001,223,0002,113,536
10Jun 14, 2026 11:481,79112,138,4833,239,0001,240,0002,113,536
11Jun 14, 2026 11:481,84312,178,6103,376,0001,233,0002,113,536
12Jun 14, 2026 11:481,87812,298,8023,473,0001,222,0002,113,536