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 29, 2026 10:08Victor MerckléVictor MerckléScore: 2,832Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 10:092,81415,377,7315,721,0001,315,0002,113,536
2May 29, 2026 10:092,81616,479,9665,724,0001,317,0002,113,536
3May 29, 2026 10:092,81916,357,2405,727,0001,321,0002,113,536
4May 29, 2026 10:092,82314,838,8875,735,0001,323,0002,113,536
5May 29, 2026 10:092,83215,705,8575,762,0001,320,0002,113,536
6May 29, 2026 10:092,89716,942,4415,887,0001,357,0002,113,536
7May 29, 2026 10:092,90515,226,8385,941,0001,323,0002,113,536
8May 29, 2026 10:092,95315,101,1726,063,0001,321,0002,113,536
9May 29, 2026 10:093,00015,419,5015,210,0002,291,0002,113,536