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 16, 2026 04:51Victor MerckléVictor MerckléError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 01:31Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 03:13013,022,0333,433,0001,311,0002,113,536pos 6: expected 0 got 255
2Sep 5, 2026 03:13023,899,5103,777,0001,310,0002,113,536pos 28: expected 4 got 3
3Jun 16, 2026 04:541,69611,591,1862,892,0001,350,0002,113,536
4Jun 16, 2026 04:541,69711,590,7782,893,0001,350,0002,113,536
5Jun 16, 2026 04:541,69911,682,5002,897,0001,352,0002,113,536
6Jun 16, 2026 04:541,70111,648,7603,051,0001,203,0002,113,536
7Jun 16, 2026 04:541,70211,626,8322,906,0001,350,0002,113,536
8Jun 16, 2026 04:541,70811,826,2112,908,0001,362,0002,113,536
9Jun 16, 2026 04:541,71211,600,7993,076,0001,205,0002,113,536
10Jun 16, 2026 04:541,72211,661,1413,097,0001,210,0002,113,536
11Jun 16, 2026 04:541,85412,063,0273,432,0001,205,0002,113,536
12Sep 5, 2026 03:131,86512,922,1033,475,0001,188,0002,113,536