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 13:03Victor MerckléVictor MerckléScore: 2,851Success
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 13:042,73514,624,5645,700,0001,138,0002,113,536
2May 20, 2026 13:042,73714,652,3615,706,0001,138,0002,113,536
3May 20, 2026 13:042,74215,798,3655,719,0001,138,0002,113,536
4May 20, 2026 13:042,76616,614,6745,767,0001,150,0002,113,536
5May 20, 2026 13:042,85116,506,8005,992,0001,136,0002,113,536
6May 20, 2026 13:042,85516,609,0225,996,0001,143,0002,113,536
7May 20, 2026 13:042,86015,431,6326,009,0001,143,0002,113,536
8May 20, 2026 13:042,86517,849,4506,024,0001,140,0002,113,536
9May 20, 2026 13:042,92015,052,3295,289,0002,011,0002,113,536