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 7, 2026 01:51Victor MerckléVictor MerckléScore: 2,844Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 01:522,67214,684,5404,129,0002,552,0002,146,304stderr
2Jul 7, 2026 01:522,68716,829,1823,897,0002,821,0002,142,208stderr
3Jul 7, 2026 01:522,71017,033,0154,218,0002,557,0002,146,304stderr
4Jul 7, 2026 01:522,72617,011,7544,587,0002,229,0002,146,304stderr
5Jul 7, 2026 01:522,84417,466,3024,788,0002,322,0002,146,304stderr
6Jul 7, 2026 01:522,85517,375,0264,693,0002,446,0002,146,304stderr
7Jul 7, 2026 01:522,87417,463,7724,840,0002,346,0002,146,304stderr
8Jul 7, 2026 01:522,88018,176,6164,859,0002,343,0002,146,304stderr
9Jul 7, 2026 01:522,94718,059,5744,950,0002,418,0002,146,304stderr