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 27, 2026 01:56Victor 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:13018,659,4495,085,0002,992,0002,138,112pos 34: expected 166 got 165
2Oct 31, 2026 15:13018,704,3145,086,0002,970,0002,138,112pos 32: expected 252 got 251
3Oct 31, 2026 15:13018,275,7904,432,0003,235,0002,187,264pos 106: expected 175 got 174
4Jun 27, 2026 02:003,05516,713,5824,468,0003,170,0002,187,264
5Jun 27, 2026 02:003,24717,143,9485,245,0002,874,0002,138,112
6Jun 27, 2026 02:003,26317,142,7945,243,0002,915,0002,129,920
7Jun 27, 2026 02:003,26517,252,2125,275,0002,888,0002,138,112
8Jun 27, 2026 02:003,27017,126,4724,447,0003,729,0002,154,496
9Jun 27, 2026 02:003,28217,254,0204,515,0003,691,0002,187,264
10Jun 27, 2026 02:003,29317,219,0334,540,0003,694,0002,154,496
11Jun 27, 2026 02:003,31617,259,6825,420,0002,870,0002,134,016
12Jun 27, 2026 02:003,32217,373,6855,417,0002,888,0002,138,112