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 30, 2026 08:06Victor MerckléVictor MerckléScore: 2,806Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 08:082,70216,867,0435,432,0001,323,0002,113,536
2May 30, 2026 08:082,70416,241,7125,440,0001,320,0002,113,536
3May 30, 2026 08:082,73115,814,7085,504,0001,324,0002,113,536
4May 30, 2026 08:082,75714,721,3345,542,0001,351,0002,113,536
5May 30, 2026 08:082,80615,789,5215,689,0001,327,0002,113,536
6May 30, 2026 08:082,81714,668,4995,711,0001,333,0002,113,536
7May 30, 2026 08:082,83417,704,9055,756,0001,331,0002,113,536
8May 30, 2026 08:082,87117,183,8534,870,0002,308,0002,113,536
9May 30, 2026 08:082,88115,051,9084,881,0002,323,0002,113,536