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 08:48Victor MerckléVictor MerckléScore: 2,648Success
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 08:502,53614,105,4225,005,0001,336,0002,113,536
2May 30, 2026 08:502,54314,566,4285,019,0001,340,0002,113,536
3May 30, 2026 08:502,56914,811,1425,081,0001,342,0002,113,536
4May 30, 2026 08:502,63616,527,3495,254,0001,337,0002,113,536
5May 30, 2026 08:502,64815,681,0055,283,0001,339,0002,113,536
6May 30, 2026 08:502,65015,517,8245,288,0001,338,0002,113,536
7May 30, 2026 08:502,67017,034,0775,325,0001,351,0002,113,536
8May 30, 2026 08:502,67114,414,7695,324,0001,354,0002,113,536
9May 30, 2026 08:502,69214,567,6064,440,0002,290,0002,113,536