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 12:55Victor MerckléVictor MerckléScore: 2,784Success
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 12:572,74714,445,0375,734,0001,134,0002,113,536
2May 20, 2026 12:572,75215,216,1115,745,0001,136,0002,113,536
3May 20, 2026 12:572,76214,734,8305,766,0001,139,0002,113,536
4May 20, 2026 12:572,77414,751,5905,789,0001,146,0002,113,536
5May 20, 2026 12:572,78416,533,0185,812,0001,150,0002,113,536
6May 20, 2026 12:572,85816,667,4316,008,0001,138,0002,113,536
7May 20, 2026 12:572,86916,159,2846,033,0001,140,0002,113,536
8May 20, 2026 12:572,87115,550,1116,039,0001,139,0002,113,536
9May 20, 2026 12:572,93317,321,2075,300,0002,033,0002,113,536