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:04Victor MerckléVictor MerckléScore: 2,596Success
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:052,54814,138,4954,979,0001,392,0002,113,536
2May 30, 2026 11:052,55615,716,0464,993,0001,397,0002,113,536
3May 30, 2026 11:052,56814,244,0585,022,0001,399,0002,113,536
4May 30, 2026 11:052,56915,460,2485,023,0001,400,0002,113,536
5May 30, 2026 11:052,59617,199,9725,074,0001,418,0002,113,536
6May 30, 2026 11:052,63514,344,8225,192,0001,397,0002,113,536
7May 30, 2026 11:052,65116,105,6925,237,0001,391,0002,113,536
8May 30, 2026 11:052,71815,580,0004,419,0002,376,0002,113,536
9May 30, 2026 11:052,72917,642,6824,439,0002,384,0002,113,536