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:53Victor MerckléVictor MerckléScore: 2,305Success
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:552,23413,253,9994,350,0001,236,0002,113,536
2Jun 2, 2026 03:552,24113,288,6204,374,0001,229,0002,113,536
3Jun 2, 2026 03:552,28013,394,2134,440,0001,261,0002,113,536
4Jun 2, 2026 03:552,28013,371,7884,463,0001,238,0002,113,536
5Jun 2, 2026 03:552,30513,437,2494,517,0001,246,0002,113,536
6Jun 2, 2026 03:552,30714,616,3884,535,0001,233,0002,113,536
7Jun 2, 2026 03:552,31413,728,3574,549,0001,237,0002,113,536
8Jun 2, 2026 03:552,31913,501,2214,562,0001,237,0002,113,536
9Jun 2, 2026 03:552,45413,705,8973,981,0002,156,0002,113,536