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 16:13Victor MerckléVictor MerckléScore: 2,722Success
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 16:142,71017,541,4855,432,0001,343,0002,113,536
2May 20, 2026 16:142,71416,375,5925,437,0001,349,0002,113,536
3May 20, 2026 16:142,72014,643,6195,448,0001,354,0002,113,536
4May 20, 2026 16:142,72015,192,8085,448,0001,353,0002,113,536
5May 20, 2026 16:142,72214,782,3265,460,0001,347,0002,113,536
6May 20, 2026 16:142,72414,700,8205,462,0001,348,0002,113,536
7May 20, 2026 16:142,77215,824,0695,555,0001,377,0002,113,536
8May 20, 2026 16:142,78815,067,7304,660,0002,310,0002,113,536
9May 20, 2026 16:142,80216,817,4815,663,0001,343,0002,113,536