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 23:22Victor MerckléVictor MerckléScore: 2,988Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 23:232,79017,947,6874,445,0002,532,0002,142,208
2Jun 10, 2026 23:232,86215,929,7904,494,0002,662,0002,142,208
3Jun 10, 2026 23:232,87617,282,5774,565,0002,627,0002,142,208
4Jun 10, 2026 23:232,92916,503,2024,687,0002,636,0002,142,208
5Jun 10, 2026 23:232,98816,524,1634,774,0002,697,0002,142,208
6Jun 10, 2026 23:232,99417,936,1134,799,0002,686,0002,142,208
7Jun 10, 2026 23:232,99516,712,3795,003,0002,485,0002,142,208
8Jun 10, 2026 23:233,00117,146,1664,828,0002,676,0002,142,208
9Jun 10, 2026 23:233,04417,223,8825,207,0002,403,0002,138,112