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 09:27Victor MerckléVictor MerckléScore: 2,616Success
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 09:292,54314,995,5195,019,0001,339,0002,113,536
2May 30, 2026 09:292,55014,125,9315,033,0001,344,0002,113,536
3May 30, 2026 09:292,55214,161,4485,039,0001,343,0002,113,536
4May 30, 2026 09:292,60315,150,6675,146,0001,363,0002,113,536
5May 30, 2026 09:292,61614,152,1745,162,0001,378,0002,113,536
6May 30, 2026 09:292,64114,391,6015,268,0001,336,0002,113,536
7May 30, 2026 09:292,65015,628,6925,286,0001,341,0002,113,536
8May 30, 2026 09:292,65415,253,1785,291,0001,344,0002,113,536
9May 30, 2026 09:292,70215,999,6154,460,0002,295,0002,113,536