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 listMay 20, 2026 14:53Victor MerckléVictor MerckléScore: 2,795Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 14:542,71715,581,4775,458,0001,336,0002,113,536
2May 20, 2026 14:542,72815,447,1785,483,0001,339,0002,113,536
3May 20, 2026 14:542,73015,696,0025,484,0001,341,0002,113,536
4May 20, 2026 14:542,77115,641,5945,589,0001,340,0002,113,536
5May 20, 2026 14:542,79515,719,1465,615,0001,373,0002,113,536
6May 20, 2026 14:542,84515,620,0665,777,0001,336,0002,113,536
7May 20, 2026 14:542,88414,976,3954,889,0002,321,0002,113,536
8May 20, 2026 14:542,90616,121,1914,963,0002,303,0002,113,536
9May 20, 2026 14:542,91722,641,1404,897,0002,397,0002,113,536