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 2, 2026 03:47Victor MerckléVictor MerckléScore: 2,314Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 03:482,23213,731,9344,353,0001,229,0002,113,536
2Jun 2, 2026 03:482,30413,437,6264,526,0001,235,0002,113,536
3Jun 2, 2026 03:482,30615,431,9834,532,0001,233,0002,113,536
4Jun 2, 2026 03:482,31213,422,2644,542,0001,239,0002,113,536
5Jun 2, 2026 03:482,31413,467,0504,548,0001,238,0002,113,536
6Jun 2, 2026 03:482,31613,402,8474,556,0001,236,0002,113,536
7Jun 2, 2026 03:482,32413,430,6354,561,0001,251,0002,113,536
8Jun 2, 2026 03:482,32713,520,8224,564,0001,254,0002,113,536
9Jun 2, 2026 03:482,34713,721,7504,612,0001,257,0002,113,536