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 13:13Victor MerckléVictor MerckléScore: 2,560Success
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 13:152,53515,978,5895,003,0001,335,0002,113,536
2May 30, 2026 13:152,54815,417,1925,031,0001,339,0002,113,536
3May 30, 2026 13:152,55414,097,3325,048,0001,337,0002,113,536
4May 30, 2026 13:152,55515,597,7315,051,0001,337,0002,113,536
5May 30, 2026 13:152,56015,957,9365,057,0001,343,0002,113,536
6May 30, 2026 13:152,64314,476,1805,280,0001,329,0002,113,536
7May 30, 2026 13:152,67415,281,6375,345,0001,341,0002,113,536
8May 30, 2026 13:152,68014,486,9594,429,0002,273,0002,113,536
9May 30, 2026 13:152,72316,660,2744,515,0002,293,0002,113,536