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

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

Challenge History
DateChallengerCostTypeStatus
Oct 31, 2026 13:23Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 13:28013,513,8043,069,0001,203,0002,113,536pos 34: expected 66 got 65
2Oct 31, 2026 13:28013,648,5353,064,0001,358,0002,113,536pos 6: expected 0 got 255
3Oct 31, 2026 13:28013,591,1513,110,0001,229,0002,113,536pos 30: expected 147 got 146
4Jun 14, 2026 11:111,73211,955,3523,114,0001,218,0002,113,536
5Jun 14, 2026 11:111,75112,075,4743,142,0001,237,0002,113,536
6Jun 14, 2026 11:111,77912,164,8673,230,0001,218,0002,113,536
7Jun 14, 2026 11:111,78612,377,7453,239,0001,228,0002,113,536
8Jun 14, 2026 11:111,81412,163,8513,305,0001,232,0002,113,536
9Jun 14, 2026 11:111,83412,542,6373,342,0001,243,0002,113,536
10Jun 14, 2026 11:111,84312,551,7733,394,0001,214,0002,113,536
11Jun 14, 2026 11:111,84812,606,8743,386,0001,236,0002,113,536
12Jun 14, 2026 11:111,88812,638,2783,479,0001,242,0002,113,536