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 5, 2026 21:52Victor MerckléVictor MerckléScore: 1,730Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 21:541,65212,092,2292,879,0001,253,0002,129,920stderr
2Jul 5, 2026 21:541,66112,058,9702,887,0001,266,0002,129,920stderr
3Jul 5, 2026 21:541,69112,226,2322,937,0001,291,0002,129,920stderr
4Jul 5, 2026 21:541,70112,206,3953,021,0001,233,0002,129,920stderr
5Jul 5, 2026 21:541,73012,785,3843,030,0001,297,0002,129,920stderr
6Jul 5, 2026 21:541,73012,253,0683,040,0001,287,0002,129,920stderr
7Jul 5, 2026 21:541,74512,396,8293,095,0001,268,0002,129,920stderr
8Jul 5, 2026 21:541,75712,448,3043,245,0001,149,0002,129,920stderr
9Jul 5, 2026 21:541,76812,827,8483,147,0001,275,0002,129,920stderr