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 29, 2026 11:37Victor MerckléVictor MerckléScore: 2,642Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 11:382,61815,718,6495,200,0001,345,0002,113,536
2May 29, 2026 11:382,61914,409,6645,205,0001,344,0002,113,536
3May 29, 2026 11:382,62614,379,6775,223,0001,342,0002,113,536
4May 29, 2026 11:382,62915,030,9145,226,0001,347,0002,113,536
5May 29, 2026 11:382,64215,945,4215,251,0001,356,0002,113,536
6May 29, 2026 11:382,72717,514,8015,480,0001,338,0002,113,536
7May 29, 2026 11:382,75316,882,1635,543,0001,340,0002,113,536
8May 29, 2026 11:382,77214,965,6044,626,0002,306,0002,113,536
9May 29, 2026 11:382,80817,011,7354,720,0002,300,0002,113,536