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 11:21Victor MerckléVictor MerckléScore: 2,594Success
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 11:232,55815,114,4445,072,0001,325,0002,113,536
2May 30, 2026 11:232,56614,207,2055,087,0001,328,0002,113,536
3May 30, 2026 11:232,56715,364,1345,092,0001,326,0002,113,536
4May 30, 2026 11:232,58214,267,9295,123,0001,333,0002,113,536
5May 30, 2026 11:232,59414,066,7865,141,0001,345,0002,113,536
6May 30, 2026 11:232,62316,290,6625,214,0001,344,0002,113,536
7May 30, 2026 11:232,62416,023,7535,238,0001,322,0002,113,536
8May 30, 2026 11:232,67715,147,4635,365,0001,328,0002,113,536
9May 30, 2026 11:232,72416,192,8534,524,0002,288,0002,113,536