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 12:30Victor MerckléVictor MerckléScore: 2,922Success
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 12:322,80515,227,9605,883,0001,131,0002,113,536
2May 20, 2026 12:322,83014,939,2625,945,0001,132,0002,113,536
3May 20, 2026 12:322,89215,894,4456,071,0001,160,0002,113,536
4May 20, 2026 12:322,90417,479,8086,127,0001,135,0002,113,536
5May 20, 2026 12:322,92215,050,6516,169,0001,136,0002,113,536
6May 20, 2026 12:322,93416,298,0146,199,0001,138,0002,113,536
7May 20, 2026 12:322,93815,113,5156,210,0001,137,0002,113,536
8May 20, 2026 12:322,94815,102,9666,233,0001,139,0002,113,536
9May 20, 2026 12:322,95417,378,5726,248,0001,138,0002,113,536