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 13:36Victor MerckléVictor MerckléScore: 2,777Success
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 13:382,74314,660,7225,645,0001,213,0002,113,536
2May 20, 2026 13:382,75014,743,9865,661,0001,216,0002,113,536
3May 20, 2026 13:382,76216,001,1125,688,0001,219,0002,113,536
4May 20, 2026 13:382,77114,860,2515,707,0001,221,0002,113,536
5May 20, 2026 13:382,77716,863,5065,715,0001,229,0002,113,536
6May 20, 2026 13:382,86016,776,1975,936,0001,215,0002,113,536
7May 20, 2026 13:382,86614,889,9915,950,0001,216,0002,113,536
8May 20, 2026 13:382,87316,825,4855,965,0001,218,0002,113,536
9May 20, 2026 13:382,93616,975,3215,214,0002,128,0002,113,536