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 30, 2026 03:31Victor MerckléVictor MerckléScore: 2,605Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 03:322,53216,017,9614,995,0001,336,0002,113,536
2May 30, 2026 03:322,53414,483,7515,005,0001,331,0002,113,536
3May 30, 2026 03:322,55714,109,6335,042,0001,351,0002,113,536
4May 30, 2026 03:322,59814,648,1995,161,0001,335,0002,113,536
5May 30, 2026 03:322,60514,485,8995,186,0001,328,0002,113,536
6May 30, 2026 03:322,61815,066,6895,217,0001,328,0002,113,536
7May 30, 2026 03:322,62815,635,8675,238,0001,333,0002,113,536
8May 30, 2026 03:322,64814,456,6924,347,0002,275,0002,113,536
9May 30, 2026 03:322,67114,401,1654,414,0002,264,0002,113,536