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 13, 2026 13:41Victor MerckléVictor MerckléScore: 29,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 13:4228,94179,704,45071,334,0001,019,0002,113,536
2Jun 13, 2026 13:4229,13280,130,63771,811,0001,019,0002,113,536
3Jun 13, 2026 13:4229,19380,272,49871,965,0001,018,0002,113,536
4Jun 13, 2026 13:4229,40480,786,76472,491,0001,020,0002,113,536
5Jun 13, 2026 13:4229,41480,795,21672,515,0001,020,0002,113,536
6Jun 13, 2026 13:4229,42980,818,62972,552,0001,021,0002,113,536
7Jun 13, 2026 13:4229,43382,483,04572,563,0001,020,0002,113,536
8Jun 13, 2026 13:4229,44880,825,65672,600,0001,021,0002,113,536
9Jun 13, 2026 13:4229,54081,100,38572,831,0001,020,0002,113,536