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

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

Challenge History
DateChallengerCostTypeStatus
Oct 31, 2026 14:50Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 15:14016,616,8474,911,0002,515,0002,142,208pos 8: expected 200 got 199
2Oct 31, 2026 15:142,99816,669,6605,108,0002,389,0002,142,208
3Jun 10, 2026 09:253,13516,999,5315,321,0002,518,0002,142,208
4Jun 10, 2026 09:253,18017,483,0055,695,0002,257,0002,138,112
5Jun 10, 2026 09:253,20317,204,2245,378,0002,630,0002,142,208
6Jun 10, 2026 09:253,22117,393,1055,397,0002,656,0002,142,208
7Oct 31, 2026 15:143,23717,428,7565,444,0002,649,0002,138,112
8Jun 10, 2026 09:253,24317,272,7525,412,0002,697,0002,142,208
9Jun 10, 2026 09:253,24315,605,8725,794,0002,315,0002,138,112
10Jun 10, 2026 09:253,25318,536,0485,526,0002,607,0002,142,208
11Jun 10, 2026 09:253,25817,497,5295,492,0002,655,0002,142,208
12Jun 10, 2026 09:253,37615,957,4284,713,0003,729,0002,138,112