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 16:01Victor MerckléVictor MerckléScore: 2,790Success
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 16:022,60516,755,1473,895,0002,618,0002,146,304stderr
2Jul 7, 2026 16:022,66016,755,4134,052,0002,599,0002,146,304stderr
3Jul 7, 2026 16:022,69414,708,3094,367,0002,370,0002,146,304stderr
4Jul 7, 2026 16:022,72216,893,6564,629,0002,176,0002,146,304stderr
5Jul 7, 2026 16:022,79016,266,8714,745,0002,232,0002,146,304stderr
6Jul 7, 2026 16:022,82417,020,6784,598,0002,463,0002,146,304stderr
7Jul 7, 2026 16:022,83417,400,0244,611,0002,475,0002,142,208stderr
8Jul 7, 2026 16:022,89017,382,1414,764,0002,463,0002,146,304stderr
9Jul 7, 2026 16:022,89717,485,9974,919,0002,324,0002,146,304stderr