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 11:00Victor MerckléVictor MerckléScore: 2,579Success
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 11:022,53214,769,0795,004,0001,328,0002,113,536
2May 30, 2026 11:022,53816,192,2205,013,0001,332,0002,113,536
3May 30, 2026 11:022,55114,143,1175,044,0001,334,0002,113,536
4May 30, 2026 11:022,55114,195,6875,049,0001,330,0002,113,536
5May 30, 2026 11:022,57914,403,8145,094,0001,354,0002,113,536
6May 30, 2026 11:022,63616,879,9855,263,0001,328,0002,113,536
7May 30, 2026 11:022,65316,223,4135,302,0001,331,0002,113,536
8May 30, 2026 11:022,70215,817,8484,463,0002,292,0002,113,536
9May 30, 2026 11:022,71015,002,9354,478,0002,297,0002,113,536