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 listDec 24, 2023 21:54Kenneth MaplesKenneth MaplesScore: 119,761Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2023 21:5479,008255,916,293197,519,52902,195,456
2Dec 24, 2023 21:5479,044257,405,414197,610,34402,191,360
3Dec 24, 2023 21:5479,046271,314,289197,616,20402,191,360
4Dec 24, 2023 21:54119,331331,629,638290,320,0008,008,0002,478,080
5Dec 24, 2023 21:54119,496330,485,837290,747,0007,993,0002,473,984
6Dec 24, 2023 21:54119,502328,961,478290,761,0007,993,0002,396,160
7Dec 24, 2023 21:54119,761326,739,444289,389,00010,013,0002,445,312
8Dec 24, 2023 21:54119,786322,278,536293,457,0006,009,0002,478,080
9Dec 24, 2023 21:54119,793325,907,671285,460,00014,022,0002,379,776
10Dec 24, 2023 21:54119,826332,021,691297,561,0002,003,0002,355,200
11Dec 24, 2023 21:54119,834324,196,534292,572,0007,013,0002,396,160
12Dec 24, 2023 21:54119,914324,162,602281,797,00017,987,0002,424,832