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 04:35Victor MerckléVictor MerckléScore: 2,605Success
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 04:362,53315,087,5555,001,0001,333,0002,113,536
2May 30, 2026 04:362,54015,921,7965,011,0001,339,0002,113,536
3May 30, 2026 04:362,55915,335,1725,041,0001,358,0002,113,536
4May 30, 2026 04:362,56215,781,0645,010,0001,396,0002,113,536
5May 30, 2026 04:362,60516,370,5195,189,0001,325,0002,113,536
6May 30, 2026 04:362,61314,741,4445,201,0001,332,0002,113,536
7May 30, 2026 04:362,62015,170,3945,222,0001,328,0002,113,536
8May 30, 2026 04:362,63814,360,9675,262,0001,334,0002,113,536
9May 30, 2026 04:362,64414,377,7925,264,0001,348,0002,113,536