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 20, 2026 13:05Victor MerckléVictor MerckléScore: 2,840Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 13:062,72416,284,8325,677,0001,134,0002,113,536
2May 20, 2026 13:062,74114,616,5455,716,0001,138,0002,113,536
3May 20, 2026 13:062,79529,991,7675,840,0001,149,0002,113,536
4May 20, 2026 13:062,84015,367,1145,962,0001,139,0002,113,536
5May 20, 2026 13:062,84014,733,4955,951,0001,150,0002,113,536
6May 20, 2026 13:062,84917,492,2945,981,0001,142,0002,113,536
7May 20, 2026 13:062,86916,868,0086,030,0001,143,0002,113,536
8May 20, 2026 13:062,87017,351,5576,036,0001,139,0002,113,536
9May 20, 2026 13:062,91415,686,4875,274,0002,012,0002,113,536