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 1, 2026 13:45Victor MerckléVictor MerckléScore: 5,978Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 13:465,84835,501,14111,248,0003,374,0002,478,080
2May 1, 2026 13:465,89930,534,34611,589,0003,160,0002,486,272
3May 1, 2026 13:465,94429,770,0068,917,0005,944,0002,531,328
4May 1, 2026 13:465,95330,512,2969,923,0004,961,0002,490,368
5May 1, 2026 13:465,97836,903,6019,965,0004,982,0002,469,888
6May 1, 2026 13:465,98030,577,51510,964,0003,987,0002,469,888
7May 1, 2026 13:465,99628,824,33610,708,0004,283,0002,469,888
8May 1, 2026 13:466,02635,724,13310,045,0005,022,0002,473,984
9May 1, 2026 13:466,04830,886,85711,090,0004,032,0002,478,080