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 11:20Victor MerckléVictor MerckléScore: 2,670Success
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 11:212,63014,372,1495,236,0001,339,0002,113,536
2May 29, 2026 11:212,64214,205,3215,262,0001,343,0002,113,536
3May 29, 2026 11:212,65115,950,1435,278,0001,350,0002,113,536
4May 29, 2026 11:212,66514,541,0755,316,0001,348,0002,113,536
5May 29, 2026 11:212,67014,854,8255,316,0001,360,0002,113,536
6May 29, 2026 11:212,67617,461,0895,327,0001,363,0002,113,536
7May 29, 2026 11:212,74614,618,2005,530,0001,335,0002,113,536
8May 29, 2026 11:212,75017,194,5915,534,0001,342,0002,113,536
9May 29, 2026 11:212,81816,058,2884,746,0002,299,0002,113,536