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 15, 2026 16:13Victor 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:12013,284,0153,121,0001,221,0002,113,536pos 22: expected 198 got 197
2Oct 31, 2026 15:12013,544,8373,102,0001,218,0002,113,536pos 10: expected 3 got 2
3Oct 31, 2026 15:12013,333,8863,117,0001,216,0002,113,536pos 40: expected 9 got 8
4Jun 15, 2026 16:161,72311,699,5863,102,0001,206,0002,113,536
5Jun 15, 2026 16:161,72911,716,0893,109,0001,215,0002,113,536
6Jun 15, 2026 16:161,81311,882,0553,334,0001,199,0002,113,536
7Jun 15, 2026 16:161,82011,981,0983,355,0001,197,0002,113,536
8Jun 15, 2026 16:161,82611,796,7323,365,0001,200,0002,113,536
9Jun 15, 2026 16:161,83111,931,2883,375,0001,203,0002,113,536
10Jun 15, 2026 16:161,84911,937,3313,422,0001,201,0002,113,536
11Jun 15, 2026 16:161,84911,994,5053,425,0001,199,0002,113,536
12Jun 15, 2026 16:161,89312,053,0003,342,0001,391,0002,113,536