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 listJul 9, 2026 01:11Victor MerckléVictor MerckléScore: 2,238Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 01:122,18515,296,7882,944,0002,519,0002,146,304stderr
2Jul 9, 2026 01:122,22214,097,9502,991,0002,564,0002,146,304stderr
3Jul 9, 2026 01:122,23115,861,7693,365,0002,214,0002,146,304stderr
4Jul 9, 2026 01:122,23415,570,2583,334,0002,253,0002,146,304stderr
5Jul 9, 2026 01:122,23815,384,7962,932,0002,663,0002,146,304stderr
6Jul 9, 2026 01:122,23816,051,6682,956,0002,639,0002,146,304stderr
7Jul 9, 2026 01:122,24614,935,0352,958,0002,658,0002,146,304stderr
8Jul 9, 2026 01:122,25615,713,7733,384,0002,257,0002,146,304stderr
9Jul 9, 2026 01:122,28515,799,1913,377,0002,337,0002,146,304stderr