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 10:37Victor MerckléVictor MerckléScore: 2,567Success
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 10:392,49414,494,4874,898,0001,339,0002,113,536
2May 30, 2026 10:392,49816,149,7854,907,0001,338,0002,113,536
3May 30, 2026 10:392,50814,036,4814,927,0001,343,0002,113,536
4May 30, 2026 10:392,54417,497,0085,023,0001,339,0002,113,536
5May 30, 2026 10:392,56715,315,2595,075,0001,344,0002,113,536
6May 30, 2026 10:392,58117,031,6035,108,0001,345,0002,113,536
7May 30, 2026 10:392,61415,438,9284,252,0002,283,0002,113,536
8May 30, 2026 10:392,61514,907,1174,249,0002,290,0002,113,536
9May 30, 2026 10:392,66716,289,7724,280,0002,388,0002,113,536