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 29, 2026 23:04Victor MerckléVictor MerckléScore: 2,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 23:062,51615,643,9244,965,0001,327,0002,113,536
2May 29, 2026 23:062,52015,879,3164,973,0001,328,0002,113,536
3May 29, 2026 23:062,53414,179,2345,006,0001,330,0002,113,536
4May 29, 2026 23:062,53516,897,1935,007,0001,331,0002,113,536
5May 29, 2026 23:062,54316,085,5665,018,0001,341,0002,113,536
6May 29, 2026 23:062,59515,357,0975,124,0001,364,0002,113,536
7May 29, 2026 23:062,60915,674,4205,199,0001,325,0002,113,536
8May 29, 2026 23:062,62516,070,6485,239,0001,324,0002,113,536
9May 29, 2026 23:062,64415,156,2535,271,0001,340,0002,113,536