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 00:39Victor 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 00:412,51715,067,0104,962,0001,331,0002,113,536
2May 30, 2026 00:412,51914,766,2464,967,0001,332,0002,113,536
3May 30, 2026 00:412,54114,041,9775,014,0001,339,0002,113,536
4May 30, 2026 00:412,55514,891,1735,037,0001,352,0002,113,536
5May 30, 2026 00:412,56015,977,5705,052,0001,349,0002,113,536
6May 30, 2026 00:412,59216,163,5045,112,0001,370,0002,113,536
7May 30, 2026 00:412,59917,120,5075,162,0001,336,0002,113,536
8May 30, 2026 00:412,61214,544,5525,200,0001,332,0002,113,536
9May 30, 2026 00:412,62014,404,1475,221,0001,331,0002,113,536