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 8, 2026 11:41Victor MerckléVictor MerckléScore: 1,829Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 11:431,77312,099,0573,194,0001,239,0002,113,536
2Jun 8, 2026 11:431,77511,907,9593,198,0001,240,0002,113,536
3Jun 8, 2026 11:431,80412,009,7653,170,0001,340,0002,113,536
4Jun 8, 2026 11:431,82412,565,1713,330,0001,232,0002,113,536
5Jun 8, 2026 11:431,82912,225,9913,339,0001,234,0002,113,536
6Jun 8, 2026 11:431,86912,405,9553,453,0001,221,0002,113,536
7Jun 8, 2026 11:431,87312,572,8683,431,0001,253,0002,113,536
8Jun 8, 2026 11:431,89512,365,2143,504,0001,234,0002,113,536
9Jun 8, 2026 11:431,96412,336,2763,478,0001,433,0002,113,536