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 05:45Yuriy LyfenkoYuriy LyfenkoScore: 4,765Success
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 05:454,632772,866,300694,874,272016,900,096
2Mar 25, 2023 05:454,654763,251,129698,100,097016,908,288
3Mar 25, 2023 05:454,664776,645,334699,557,680016,912,384
4Mar 25, 2023 05:454,723732,011,277677,516,00030,977,00017,072,128
5Mar 25, 2023 05:454,741743,280,617682,209,00028,966,00017,174,528
6Mar 25, 2023 05:454,749735,768,572686,323,00025,974,00017,006,592
7Mar 25, 2023 05:454,765739,721,995682,736,00031,940,00017,072,128
8Mar 25, 2023 05:454,783739,362,422685,446,00031,974,00017,108,992
9Mar 25, 2023 05:454,787739,866,342687,104,00030,959,00017,174,528
10Mar 25, 2023 05:454,787742,940,709684,164,00033,958,00017,072,128
11Mar 25, 2023 05:454,792745,714,023682,882,00035,941,00017,068,032
12Mar 25, 2023 05:454,794751,561,066685,150,00033,957,00017,072,128