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 29, 2026 10:35Victor MerckléVictor MerckléScore: 2,703Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 10:362,61816,192,4045,205,0001,342,0002,113,536
2May 29, 2026 10:362,63814,340,0845,246,0001,350,0002,113,536
3May 29, 2026 10:362,64914,346,9975,272,0001,351,0002,113,536
4May 29, 2026 10:362,69514,548,3675,392,0001,346,0002,113,536
5May 29, 2026 10:362,70316,644,3635,390,0001,369,0002,113,536
6May 29, 2026 10:362,71414,614,8595,443,0001,344,0002,113,536
7May 29, 2026 10:362,74015,696,6165,505,0001,346,0002,113,536
8May 29, 2026 10:362,76615,066,4395,568,0001,348,0002,113,536
9May 29, 2026 10:362,77815,590,7714,631,0002,316,0002,113,536