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 15:36Victor MerckléVictor MerckléScore: 2,786Success
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 15:382,72414,689,1315,465,0001,345,0002,113,536
2May 20, 2026 15:382,75614,684,6425,524,0001,367,0002,113,536
3May 20, 2026 15:382,77814,899,0525,572,0001,374,0002,113,536
4May 20, 2026 15:382,78114,815,3525,577,0001,377,0002,113,536
5May 20, 2026 15:382,78615,583,7635,587,0001,378,0002,113,536
6May 20, 2026 15:382,79815,836,7985,657,0001,340,0002,113,536
7May 20, 2026 15:382,81816,331,7795,705,0001,342,0002,113,536
8May 20, 2026 15:382,82714,694,0995,729,0001,339,0002,113,536
9May 20, 2026 15:382,82814,804,2565,729,0001,343,0002,113,536