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 01:10Victor MerckléVictor MerckléScore: 2,616Success
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 01:122,55514,394,6955,045,0001,343,0002,113,536
2May 30, 2026 01:122,55714,172,8695,049,0001,344,0002,113,536
3May 30, 2026 01:122,58115,531,7225,112,0001,342,0002,113,536
4May 30, 2026 01:122,60014,141,1025,156,0001,344,0002,113,536
5May 30, 2026 01:122,61616,407,6565,153,0001,388,0002,113,536
6May 30, 2026 01:122,64815,177,6095,278,0001,344,0002,113,536
7May 30, 2026 01:122,66214,417,1775,305,0001,350,0002,113,536
8May 30, 2026 01:122,67015,355,0525,321,0001,355,0002,113,536
9May 30, 2026 01:122,67415,670,3185,340,0001,345,0002,113,536