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 listJun 2, 2026 17:45Victor MerckléVictor MerckléScore: 1,786Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 17:471,72712,006,0663,108,0001,211,0002,113,536
2Jun 2, 2026 17:471,73211,950,7633,114,0001,218,0002,113,536
3Jun 2, 2026 17:471,73613,201,5503,121,0001,220,0002,113,536
4Jun 2, 2026 17:471,73811,961,6073,128,0001,217,0002,113,536
5Jun 2, 2026 17:471,78612,182,9403,249,0001,218,0002,113,536
6Jun 2, 2026 17:471,78631,404,1093,234,0001,231,0002,113,536
7Jun 2, 2026 17:471,83412,243,5013,363,0001,222,0002,113,536
8Jun 2, 2026 17:471,88212,724,8553,491,0001,214,0002,113,536
9Jun 2, 2026 17:471,92112,485,0223,532,0001,272,0002,113,536