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 listJun 1, 2026 15:18Victor MerckléVictor MerckléScore: 2,512Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 15:202,49913,802,5824,919,0001,330,0002,113,536
2Jun 1, 2026 15:202,50113,819,9294,924,0001,329,0002,113,536
3Jun 1, 2026 15:202,50313,708,9344,923,0001,335,0002,113,536
4Jun 1, 2026 15:202,50313,908,4684,928,0001,330,0002,113,536
5Jun 1, 2026 15:202,51213,837,8024,942,0001,339,0002,113,536
6Jun 1, 2026 15:202,57914,108,4915,119,0001,330,0002,113,536
7Jun 1, 2026 15:202,59614,048,2955,161,0001,330,0002,113,536
8Jun 1, 2026 15:202,60414,011,8835,179,0001,331,0002,113,536
9Jun 1, 2026 15:202,61014,017,9515,189,0001,337,0002,113,536