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 11, 2026 19:37Victor MerckléVictor MerckléScore: 2,825Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 19:382,80615,719,0975,888,0001,127,0002,113,536
2May 11, 2026 19:382,81416,147,9545,901,0001,134,0002,113,536
3May 11, 2026 19:382,81715,738,0035,912,0001,131,0002,113,536
4May 11, 2026 19:382,81915,009,3565,914,0001,134,0002,113,536
5May 11, 2026 19:382,82515,198,0135,910,0001,154,0002,113,536
6May 11, 2026 19:382,84915,469,3385,978,0001,146,0002,113,536
7May 11, 2026 19:382,87615,283,0786,032,0001,160,0002,113,536
8May 11, 2026 19:382,92514,757,3196,179,0001,135,0002,113,536
9May 11, 2026 19:382,93116,537,1176,193,0001,136,0002,113,536