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 30, 2026 12:42Victor MerckléVictor MerckléScore: 2,603Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 12:442,55215,131,6265,031,0001,349,0002,113,536
2May 30, 2026 12:442,55415,853,7625,037,0001,348,0002,113,536
3May 30, 2026 12:442,55917,329,4365,047,0001,351,0002,113,536
4May 30, 2026 12:442,58715,950,8815,115,0001,353,0002,113,536
5May 30, 2026 12:442,60317,297,9405,136,0001,372,0002,113,536
6May 30, 2026 12:442,62615,953,4475,180,0001,386,0002,113,536
7May 30, 2026 12:442,67514,646,7635,332,0001,357,0002,113,536
8May 30, 2026 12:442,68315,670,1475,354,0001,354,0002,113,536
9May 30, 2026 12:442,73816,679,7864,519,0002,326,0002,113,536