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 12, 2026 03:37Victor MerckléVictor MerckléScore: 1,823Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 03:391,74911,932,1473,180,0001,194,0002,113,536
2Jun 12, 2026 03:391,77212,052,7033,238,0001,194,0002,113,536
3Jun 12, 2026 03:391,78412,063,6643,181,0001,279,0002,113,536
4Jun 12, 2026 03:391,80212,199,5033,200,0001,305,0002,113,536
5Jun 12, 2026 03:391,82312,130,4763,326,0001,232,0002,113,536
6Jun 12, 2026 03:391,84012,312,2183,401,0001,200,0002,113,536
7Jun 12, 2026 03:391,86112,336,1213,447,0001,206,0002,113,536
8Jun 12, 2026 03:391,88212,375,6303,488,0001,218,0002,113,536
9Jun 12, 2026 03:391,88212,601,0993,440,0001,266,0002,113,536