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 20, 2026 15:46Victor MerckléVictor MerckléScore: 2,743Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 15:482,72115,841,0055,466,0001,338,0002,113,536
2May 20, 2026 15:482,72415,088,0795,474,0001,338,0002,113,536
3May 20, 2026 15:482,72615,406,3045,477,0001,340,0002,113,536
4May 20, 2026 15:482,74016,151,2535,510,0001,340,0002,113,536
5May 20, 2026 15:482,74315,368,7045,513,0001,345,0002,113,536
6May 20, 2026 15:482,76014,982,5535,546,0001,356,0002,113,536
7May 20, 2026 15:482,79314,949,5555,628,0001,356,0002,113,536
8May 20, 2026 15:482,86115,288,9445,821,0001,333,0002,113,536
9May 20, 2026 15:482,87215,067,0475,829,0001,351,0002,113,536