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:57Victor MerckléVictor MerckléScore: 2,737Success
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:582,61514,337,6195,194,0001,344,0002,113,536
2May 29, 2026 11:582,62816,226,4105,221,0001,351,0002,113,536
3May 29, 2026 11:582,68116,451,2235,324,0001,379,0002,113,536
4May 29, 2026 11:582,71315,004,3985,447,0001,337,0002,113,536
5May 29, 2026 11:582,73716,409,6715,502,0001,342,0002,113,536
6May 29, 2026 11:582,74314,578,1775,519,0001,339,0002,113,536
7May 29, 2026 11:582,76014,978,1575,556,0001,345,0002,113,536
8May 29, 2026 11:582,79115,661,9494,679,0002,299,0002,113,536
9May 29, 2026 11:582,80816,459,4214,701,0002,320,0002,113,536