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 listMay 20, 2026 14:03Victor MerckléVictor MerckléScore: 2,831Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 14:052,70216,519,7705,410,0001,346,0002,113,536
2May 20, 2026 14:052,71015,466,0655,429,0001,347,0002,113,536
3May 20, 2026 14:052,71317,110,1375,435,0001,348,0002,113,536
4May 20, 2026 14:052,78015,478,1375,568,0001,382,0002,113,536
5May 20, 2026 14:052,83114,899,6655,734,0001,345,0002,113,536
6May 20, 2026 14:052,84415,008,5585,766,0001,344,0002,113,536
7May 20, 2026 14:052,84414,821,2785,769,0001,341,0002,113,536
8May 20, 2026 14:052,85015,751,0755,770,0001,357,0002,113,536
9May 20, 2026 14:052,91315,164,3764,946,0002,338,0002,113,536