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 29, 2026 23:10Victor MerckléVictor MerckléScore: 2,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 23:112,52913,966,9624,993,0001,330,0002,113,536
2May 29, 2026 23:112,55417,281,8195,037,0001,348,0002,113,536
3May 29, 2026 23:112,58914,249,3515,148,0001,326,0002,113,536
4May 29, 2026 23:112,62014,575,5005,224,0001,327,0002,113,536
5May 29, 2026 23:112,62115,818,6915,225,0001,328,0002,113,536
6May 29, 2026 23:112,62315,408,4735,231,0001,327,0002,113,536
7May 29, 2026 23:112,63715,138,9295,268,0001,326,0002,113,536
8May 29, 2026 23:112,64717,339,2055,276,0001,343,0002,113,536
9May 29, 2026 23:112,65214,248,4005,289,0001,343,0002,113,536