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 12:21Victor 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 12:232,53516,902,2585,008,0001,330,0002,113,536
2May 30, 2026 12:232,54014,324,6815,018,0001,332,0002,113,536
3May 30, 2026 12:232,54314,337,6965,021,0001,338,0002,113,536
4May 30, 2026 12:232,61016,301,4444,248,0002,277,0002,113,536
5May 30, 2026 12:232,61215,806,8654,262,0002,270,0002,113,536
6May 30, 2026 12:232,62214,147,0845,230,0001,325,0002,113,536
7May 30, 2026 12:232,62415,888,3315,222,0001,338,0002,113,536
8May 30, 2026 12:232,64816,170,1345,289,0001,332,0002,113,536
9May 30, 2026 12:232,70714,533,1174,488,0002,280,0002,113,536