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 13:39Victor MerckléVictor MerckléScore: 2,934Success
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 13:402,83515,390,0935,915,0001,173,0002,113,536
2May 20, 2026 13:402,83616,428,4855,913,0001,178,0002,113,536
3May 20, 2026 13:402,85814,909,2895,112,0002,035,0002,113,536
4May 20, 2026 13:402,90815,352,1605,128,0002,143,0002,113,536
5May 20, 2026 13:402,93415,100,1585,303,0002,034,0002,113,536
6May 20, 2026 13:402,98716,575,0575,365,0002,104,0002,113,536
7May 20, 2026 13:402,99517,376,4175,378,0002,111,0002,113,536
8May 20, 2026 13:403,00818,162,0515,410,0002,111,0002,113,536
9May 20, 2026 13:403,04318,445,3945,352,0002,256,0002,113,536