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:09Victor MerckléVictor MerckléScore: 2,622Success
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:112,54116,075,0255,021,0001,333,0002,113,536
2May 30, 2026 06:112,54316,346,2665,021,0001,338,0002,113,536
3May 30, 2026 06:112,56715,290,9785,075,0001,343,0002,113,536
4May 30, 2026 06:112,58415,800,6235,127,0001,335,0002,113,536
5May 30, 2026 06:112,62216,346,4355,229,0001,327,0002,113,536
6May 30, 2026 06:112,62415,460,3315,235,0001,327,0002,113,536
7May 30, 2026 06:112,63216,151,7555,245,0001,335,0002,113,536
8May 30, 2026 06:112,69115,324,3324,456,0002,273,0002,113,536
9May 30, 2026 06:112,70516,241,3364,471,0002,292,0002,113,536