Large matrix multiplication Liam

Multiply two square matrices as fast as possible.

Input

Two 2000 x 2000 matrices of uint32 values on STDIN, encoded back-to-back in row-major order, little-endian byte order.

Output

Write the resulting 2000 x 2000 product matrix to STDOUT in the same binary format (row-major, little-endian uint32).

Back to listMar 24, 2023 23:30Yurkov AlekseyYurkov AlekseyScore: 4,150Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2023 23:304,145712,308,844621,798,056016,936,960
2Mar 24, 2023 23:304,146646,209,936608,908,00012,998,00016,973,824
3Mar 24, 2023 23:304,147689,481,578622,028,252016,941,056
4Mar 24, 2023 23:304,147644,721,530608,086,00014,001,00017,154,048
5Mar 24, 2023 23:304,148644,277,890607,123,00015,003,00017,199,104
6Mar 24, 2023 23:304,148651,156,495612,147,00010,002,00016,982,016
7Mar 24, 2023 23:304,150647,192,758611,540,00010,991,00017,203,200
8Mar 24, 2023 23:304,150648,915,425610,570,00011,991,00016,961,536
9Mar 24, 2023 23:304,152646,581,078608,854,00013,996,00017,186,816
10Mar 24, 2023 23:304,153681,128,557622,990,576016,945,152
11Mar 24, 2023 23:304,154642,766,064613,118,00010,001,00017,145,856
12Mar 24, 2023 23:304,155651,083,773612,226,00011,004,00017,203,200