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 18:33Victor MerckléVictor MerckléScore: 3,049Success
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 18:332,96016,677,0746,280,0001,121,0002,113,536
2May 11, 2026 18:333,00117,724,6686,357,0001,147,0002,113,536
3May 11, 2026 18:333,02616,732,8036,432,0001,134,0002,113,536
4May 11, 2026 18:333,03615,708,6126,466,0001,125,0002,113,536
5May 11, 2026 18:333,04914,885,8296,491,0001,132,0002,113,536
6May 11, 2026 18:333,05115,906,1166,500,0001,129,0002,113,536
7May 11, 2026 18:333,05718,051,1466,513,0001,131,0002,113,536
8May 11, 2026 18:333,07216,583,1176,548,0001,133,0002,113,536
9May 11, 2026 18:333,07315,174,8436,547,0001,136,0002,113,536