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 04:59Victor MerckléVictor MerckléScore: 2,621Success
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 05:012,52915,928,7224,990,0001,334,0002,113,536
2May 30, 2026 05:012,53214,021,6064,998,0001,333,0002,113,536
3May 30, 2026 05:012,55714,018,2745,057,0001,337,0002,113,536
4May 30, 2026 05:012,58814,795,4635,105,0001,367,0002,113,536
5May 30, 2026 05:012,62116,213,4375,217,0001,336,0002,113,536
6May 30, 2026 05:012,62614,560,4655,237,0001,330,0002,113,536
7May 30, 2026 05:012,63015,088,9725,244,0001,331,0002,113,536
8May 30, 2026 05:012,66215,071,5734,384,0002,272,0002,113,536
9May 30, 2026 05:012,68216,301,4704,427,0002,279,0002,113,536