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 8, 2026 02:18Victor MerckléVictor MerckléScore: 1,650Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 02:201,56611,917,0322,813,0001,104,0002,117,632stderr
2Jul 8, 2026 02:201,57611,958,2542,822,0001,118,0002,117,632stderr
3Jul 8, 2026 02:201,60112,016,8162,854,0001,149,0002,117,632stderr
4Jul 8, 2026 02:201,60912,040,6202,870,0001,153,0002,117,632stderr
5Jul 8, 2026 02:201,65012,224,7002,965,0001,161,0002,117,632stderr
6Jul 8, 2026 02:201,66112,303,6813,011,0001,142,0002,117,632stderr
7Jul 8, 2026 02:201,66513,580,3843,032,0001,132,0002,117,632stderr
8Jul 8, 2026 02:201,67612,782,0733,047,0001,143,0002,117,632stderr
9Jul 8, 2026 02:201,70512,338,3763,005,0001,259,0002,117,632stderr