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 20, 2026 14:06Victor MerckléVictor MerckléScore: 2,864Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 14:072,78815,974,1965,583,0001,387,0002,113,536
2May 20, 2026 14:072,78917,334,8305,585,0001,389,0002,113,536
3May 20, 2026 14:072,80615,341,5965,619,0001,396,0002,113,536
4May 20, 2026 14:072,82415,325,8124,703,0002,357,0002,113,536
5May 20, 2026 14:072,86414,920,5874,700,0002,462,0002,113,536
6May 20, 2026 14:072,95915,887,0744,980,0002,419,0002,113,536
7May 20, 2026 14:072,98217,274,1594,957,0002,498,0002,113,536
8May 20, 2026 14:072,99626,735,5195,009,0002,482,0002,113,536
9May 20, 2026 14:073,01415,339,5844,959,0002,576,0002,113,536