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:02Victor MerckléVictor MerckléScore: 2,666Success
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:052,57914,535,4795,127,0001,321,0002,113,536
2May 30, 2026 12:052,58814,474,6055,148,0001,324,0002,113,536
3May 30, 2026 12:052,59418,176,3845,144,0001,341,0002,113,536
4May 30, 2026 12:052,63014,651,9585,219,0001,356,0002,113,536
5May 30, 2026 12:052,66616,266,7915,349,0001,317,0002,113,536
6May 30, 2026 12:052,67116,138,2505,358,0001,321,0002,113,536
7May 30, 2026 12:052,67614,408,7695,372,0001,319,0002,113,536
8May 30, 2026 12:052,68416,075,0365,386,0001,324,0002,113,536
9May 30, 2026 12:052,69514,480,3455,402,0001,336,0002,113,536