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 25, 2023 00:17Yurkov AlekseyYurkov AlekseyScore: 4,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2023 00:174,019626,016,107590,888,00011,997,00016,973,824
2Mar 25, 2023 00:174,020624,361,381589,981,00012,999,00016,957,440
3Mar 25, 2023 00:174,021628,150,912595,092,0008,001,00016,973,824
4Mar 25, 2023 00:174,021625,494,312590,142,00013,003,00017,145,856
5Mar 25, 2023 00:174,021632,259,369592,151,00011,002,00017,063,936
6Mar 25, 2023 00:174,021634,044,726589,196,00014,004,00017,158,144
7Mar 25, 2023 00:174,024669,533,118603,546,159016,949,248
8Mar 25, 2023 00:174,024630,540,377590,614,00012,991,00016,990,208
9Mar 25, 2023 00:174,025625,462,647593,740,0009,995,00016,973,824
10Mar 25, 2023 00:174,025624,324,013593,763,0009,996,00017,145,856
11Mar 25, 2023 00:174,028668,154,809604,174,027016,941,056
12Mar 25, 2023 00:174,030682,082,658604,439,640016,941,056