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 30, 2026 06:06Victor MerckléVictor MerckléScore: 2,572Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 06:082,53016,245,0194,989,0001,336,0002,113,536
2May 30, 2026 06:082,53216,329,7054,998,0001,333,0002,113,536
3May 30, 2026 06:082,53714,019,2395,005,0001,339,0002,113,536
4May 30, 2026 06:082,54015,823,9425,016,0001,334,0002,113,536
5May 30, 2026 06:082,57215,708,0315,091,0001,341,0002,113,536
6May 30, 2026 06:082,61415,195,3795,204,0001,331,0002,113,536
7May 30, 2026 06:082,65214,407,2835,284,0001,346,0002,113,536
8May 30, 2026 06:082,68215,536,0564,439,0002,267,0002,113,536
9May 30, 2026 06:082,69614,500,1304,451,0002,291,0002,113,536