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 1, 2026 12:32Victor MerckléVictor MerckléScore: 2,542Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 12:342,52713,930,4324,992,0001,326,0002,113,536
2Jun 1, 2026 12:342,52813,887,4954,991,0001,330,0002,113,536
3Jun 1, 2026 12:342,53213,896,8385,002,0001,329,0002,113,536
4Jun 1, 2026 12:342,53613,915,8655,006,0001,334,0002,113,536
5Jun 1, 2026 12:342,54215,865,4825,021,0001,336,0002,113,536
6Jun 1, 2026 12:342,55013,861,6945,033,0001,342,0002,113,536
7Jun 1, 2026 12:342,59515,554,5085,161,0001,327,0002,113,536
8Jun 1, 2026 12:342,60314,010,7985,182,0001,326,0002,113,536
9Jun 1, 2026 12:342,62814,091,1815,193,0001,377,0002,113,536