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 listJul 7, 2026 22:37Victor MerckléVictor MerckléScore: 1,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 22:391,58611,982,9052,873,0001,094,0002,117,632stderr
2Jul 7, 2026 22:391,59011,956,2052,873,0001,104,0002,117,632stderr
3Jul 7, 2026 22:391,60012,025,5192,882,0001,119,0002,117,632stderr
4Jul 7, 2026 22:391,60112,020,2612,893,0001,111,0002,117,632stderr
5Jul 7, 2026 22:391,60812,033,1332,774,0001,248,0002,117,632stderr
6Jul 7, 2026 22:391,61112,127,2982,728,0001,300,0002,117,632stderr
7Jul 7, 2026 22:391,65012,124,6562,993,0001,132,0002,117,632stderr
8Jul 7, 2026 22:391,70612,635,6802,931,0001,336,0002,117,632stderr
9Jul 7, 2026 22:391,77912,789,8903,325,0001,124,0002,117,632stderr