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 19:51Victor MerckléVictor MerckléScore: 4,155Success
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 19:554,02219,499,3377,635,0002,420,0002,142,208stderr
2Jul 7, 2026 19:554,02619,420,1506,988,0003,079,0002,138,112stderr
3Jul 7, 2026 19:554,07219,534,0847,784,0002,398,0002,142,208stderr
4Jul 7, 2026 19:554,07819,576,9307,806,0002,389,0002,142,208stderr
5Jul 7, 2026 19:554,15519,793,7647,159,0003,230,0002,142,208stderr
6Jul 7, 2026 19:554,16219,766,1498,015,0002,392,0002,142,208stderr
7Jul 7, 2026 19:554,16619,747,4917,261,0003,156,0002,134,016stderr
8Jul 7, 2026 19:554,24219,971,4718,211,0002,394,0002,134,016stderr
9Jul 7, 2026 19:554,30020,143,2727,600,0003,150,0002,134,016stderr