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 8, 2026 12:22Victor MerckléVictor MerckléScore: 2,369Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 12:232,30413,681,9082,887,0002,873,0002,146,304stderr
2Jul 8, 2026 12:232,30913,712,5542,985,0002,788,0002,146,304stderr
3Jul 8, 2026 12:232,31114,801,6763,335,0002,443,0002,146,304stderr
4Jul 8, 2026 12:232,34913,824,3493,394,0002,480,0002,146,304stderr
5Jul 8, 2026 12:232,36915,253,9703,021,0002,902,0002,146,304stderr
6Jul 8, 2026 12:232,39014,115,6923,566,0002,411,0002,146,304stderr
7Jul 8, 2026 12:232,39614,145,3573,555,0002,437,0002,146,304stderr
8Jul 8, 2026 12:232,40414,013,9293,532,0002,480,0002,146,304stderr
9Jul 8, 2026 12:232,44516,827,3713,588,0002,526,0002,146,304stderr