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 listMay 1, 2026 13:38Victor MerckléVictor MerckléScore: 4,222Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 13:384,13224,398,9807,233,0003,099,0002,437,120
2May 1, 2026 13:384,17427,465,3678,348,0002,087,0002,445,312
3May 1, 2026 13:384,18831,207,6527,330,0003,141,0002,433,024
4May 1, 2026 13:384,19933,279,0375,249,0005,249,0002,437,120
5May 1, 2026 13:384,22227,194,3736,333,0004,222,0002,424,832
6May 1, 2026 13:384,25729,622,2557,451,0003,193,0002,428,928
7May 1, 2026 13:384,28831,776,4348,578,0002,144,0002,433,024
8May 1, 2026 13:384,42325,152,9605,027,0006,032,0002,445,312
9May 1, 2026 13:384,48327,862,7396,725,0004,483,0002,437,120