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 09:42Victor MerckléVictor MerckléScore: 2,566Success
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 09:442,54414,596,8225,019,0001,341,0002,113,536
2May 30, 2026 09:442,54516,743,4465,017,0001,346,0002,113,536
3May 30, 2026 09:442,55814,307,8595,047,0001,348,0002,113,536
4May 30, 2026 09:442,56014,406,8465,051,0001,350,0002,113,536
5May 30, 2026 09:442,56615,063,0825,057,0001,359,0002,113,536
6May 30, 2026 09:442,62814,264,9485,227,0001,343,0002,113,536
7May 30, 2026 09:442,64414,403,3695,265,0001,345,0002,113,536
8May 30, 2026 09:442,67515,001,9195,317,0001,372,0002,113,536
9May 30, 2026 09:442,68314,781,0805,340,0001,368,0002,113,536