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 20, 2026 12:45Victor MerckléVictor MerckléScore: 2,821Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 12:472,80417,687,3675,885,0001,125,0002,113,536
2May 20, 2026 12:472,81017,419,5645,896,0001,129,0002,113,536
3May 20, 2026 12:472,81815,028,5095,914,0001,131,0002,113,536
4May 20, 2026 12:472,82015,715,2555,918,0001,134,0002,113,536
5May 20, 2026 12:472,82115,649,1955,918,0001,135,0002,113,536
6May 20, 2026 12:472,82415,781,1225,922,0001,138,0002,113,536
7May 20, 2026 12:472,88015,747,6066,060,0001,142,0002,113,536
8May 20, 2026 12:472,88415,597,3336,077,0001,133,0002,113,536
9May 20, 2026 12:472,94415,333,3636,227,0001,133,0002,113,536