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 16, 2026 05:22Victor MerckléVictor MerckléScore: 1,732Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2026 05:251,70111,641,7222,905,0001,349,0002,113,536
2Jun 16, 2026 05:251,70811,697,2673,064,0001,208,0002,113,536
3Jun 16, 2026 05:251,71011,603,2213,072,0001,204,0002,113,536
4Jun 16, 2026 05:251,71011,618,9293,070,0001,205,0002,113,536
5Jun 16, 2026 05:251,73211,662,9893,115,0001,215,0002,113,536
6Jun 16, 2026 05:251,73411,685,4503,124,0001,212,0002,113,536
7Jun 16, 2026 05:251,82811,979,0183,372,0001,200,0002,113,536
8Jun 16, 2026 05:251,85111,965,9843,430,0001,198,0002,113,536
9Jun 16, 2026 05:251,86412,144,1453,161,0001,499,0002,113,536