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 8, 2026 11:53Victor MerckléVictor MerckléScore: 1,787Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 11:551,76712,054,2853,168,0001,251,0002,113,536
2Jun 8, 2026 11:551,76812,127,3533,167,0001,254,0002,113,536
3Jun 8, 2026 11:551,78212,151,7873,197,0001,258,0002,113,536
4Jun 8, 2026 11:551,78512,187,4843,199,0001,265,0002,113,536
5Jun 8, 2026 11:551,78712,144,3363,206,0001,262,0002,113,536
6Jun 8, 2026 11:551,79412,289,6053,216,0001,269,0002,113,536
7Jun 8, 2026 11:551,87612,317,4503,435,0001,255,0002,113,536
8Jun 8, 2026 11:551,91012,428,6253,520,0001,257,0002,113,536
9Jun 8, 2026 11:551,92412,802,9063,555,0001,257,0002,113,536