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 21:34Victor MerckléVictor MerckléScore: 2,633Success
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 21:362,53914,094,4045,022,0001,327,0002,113,536
2May 29, 2026 21:362,54315,213,4505,029,0001,330,0002,113,536
3May 29, 2026 21:362,54817,159,7065,041,0001,329,0002,113,536
4May 29, 2026 21:362,60915,675,6815,158,0001,365,0002,113,536
5May 29, 2026 21:362,63316,410,8195,256,0001,327,0002,113,536
6May 29, 2026 21:362,63616,344,3745,242,0001,349,0002,113,536
7May 29, 2026 21:362,63715,815,1765,266,0001,327,0002,113,536
8May 29, 2026 21:362,63814,340,6315,264,0001,331,0002,113,536
9May 29, 2026 21:362,68716,289,2225,317,0001,401,0002,113,536