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 19:11Victor MerckléVictor MerckléScore: 2,698Success
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 19:132,56413,976,0895,096,0001,316,0002,113,536
2May 29, 2026 19:132,56914,222,9445,108,0001,316,0002,113,536
3May 29, 2026 19:132,57415,909,9675,119,0001,318,0002,113,536
4May 29, 2026 19:132,58217,115,1585,141,0001,316,0002,113,536
5May 29, 2026 19:132,69815,389,6275,437,0001,308,0002,113,536
6May 29, 2026 19:132,72516,689,0085,506,0001,307,0002,113,536
7May 29, 2026 19:132,73914,820,3885,513,0001,336,0002,113,536
8May 29, 2026 19:132,74417,657,2715,519,0001,343,0002,113,536
9May 29, 2026 19:132,75314,607,2795,541,0001,342,0002,113,536