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 listJun 7, 2026 11:46Victor MerckléVictor MerckléScore: 1,858Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 11:481,73011,933,9233,112,0001,214,0002,113,536
2Jun 7, 2026 11:481,76512,080,0753,182,0001,231,0002,113,536
3Jun 7, 2026 11:481,77012,048,4473,202,0001,225,0002,113,536
4Jun 7, 2026 11:481,78012,096,6243,175,0001,277,0002,113,536
5Jun 7, 2026 11:481,85812,452,8213,437,0001,210,0002,113,536
6Jun 7, 2026 11:481,86812,293,9423,450,0001,222,0002,113,536
7Jun 7, 2026 11:481,88012,384,8973,473,0001,227,0002,113,536
8Jun 7, 2026 11:481,89312,797,2543,494,0001,240,0002,113,536
9Jun 7, 2026 11:481,89613,239,3983,501,0001,241,0002,113,536