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 06:20Victor MerckléVictor MerckléScore: 2,614Success
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 06:222,53214,442,9104,988,0001,343,0002,113,536
2May 30, 2026 06:222,58416,380,8295,130,0001,331,0002,113,536
3May 30, 2026 06:222,61214,254,4545,200,0001,331,0002,113,536
4May 30, 2026 06:222,61415,410,1855,205,0001,332,0002,113,536
5May 30, 2026 06:222,61414,273,2225,206,0001,331,0002,113,536
6May 30, 2026 06:222,62014,300,1265,214,0001,337,0002,113,536
7May 30, 2026 06:222,62314,459,1655,221,0001,337,0002,113,536
8May 30, 2026 06:222,63214,335,8385,240,0001,342,0002,113,536
9May 30, 2026 06:222,64014,140,4115,250,0001,351,0002,113,536