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 16:19Victor MerckléVictor MerckléScore: 2,790Success
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 16:202,73115,479,6585,488,0001,341,0002,113,536
2May 20, 2026 16:202,74315,399,1455,505,0001,353,0002,113,536
3May 20, 2026 16:202,75014,619,1565,519,0001,357,0002,113,536
4May 20, 2026 16:202,76415,330,2555,568,0001,342,0002,113,536
5May 20, 2026 16:202,79016,194,8215,635,0001,340,0002,113,536
6May 20, 2026 16:202,83614,819,7175,754,0001,338,0002,113,536
7May 20, 2026 16:202,84415,307,1525,776,0001,335,0002,113,536
8May 20, 2026 16:202,84814,879,0665,783,0001,339,0002,113,536
9May 20, 2026 16:202,87715,537,1765,848,0001,346,0002,113,536