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:36Victor MerckléVictor MerckléScore: 2,612Success
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:382,55414,389,9895,040,0001,347,0002,113,536
2May 30, 2026 06:382,57214,061,0695,102,0001,329,0002,113,536
3May 30, 2026 06:382,59115,074,8005,111,0001,368,0002,113,536
4May 30, 2026 06:382,60015,867,4865,166,0001,335,0002,113,536
5May 30, 2026 06:382,61214,095,7425,200,0001,331,0002,113,536
6May 30, 2026 06:382,62916,252,9365,242,0001,331,0002,113,536
7May 30, 2026 06:382,62916,119,3025,240,0001,333,0002,113,536
8May 30, 2026 06:382,63414,401,1295,256,0001,331,0002,113,536
9May 30, 2026 06:382,66015,532,3685,303,0001,349,0002,113,536