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 01:21Victor MerckléVictor MerckléScore: 2,624Success
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 01:232,53814,732,8135,007,0001,340,0002,113,536
2May 30, 2026 01:232,53914,071,4675,015,0001,334,0002,113,536
3May 30, 2026 01:232,54314,375,4845,023,0001,336,0002,113,536
4May 30, 2026 01:232,61614,237,6124,235,0002,307,0002,113,536
5May 30, 2026 01:232,62414,176,1925,231,0001,331,0002,113,536
6May 30, 2026 01:232,63617,183,7485,255,0001,337,0002,113,536
7May 30, 2026 01:232,63717,006,5195,262,0001,331,0002,113,536
8May 30, 2026 01:232,69214,571,7484,436,0002,295,0002,113,536
9May 30, 2026 01:232,69416,682,1874,461,0002,275,0002,113,536