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:00Victor MerckléVictor MerckléScore: 2,805Success
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:022,74614,931,7825,727,0001,138,0002,113,536
2May 20, 2026 14:022,74616,051,0475,726,0001,139,0002,113,536
3May 20, 2026 14:022,74716,854,7895,731,0001,138,0002,113,536
4May 20, 2026 14:022,75117,730,5715,735,0001,143,0002,113,536
5May 20, 2026 14:022,80517,738,5265,850,0001,164,0002,113,536
6May 20, 2026 14:022,82327,582,1555,894,0001,164,0002,113,536
7May 20, 2026 14:022,85215,973,4375,990,0001,140,0002,113,536
8May 20, 2026 14:022,85317,882,2895,992,0001,141,0002,113,536
9May 20, 2026 14:022,88816,631,9966,068,0001,152,0002,113,536