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:27Mikhail DektyarevMikhail DektyarevScore: 26,671Success
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:2126,6584,070,023,9343,998,762,559016,973,824
2Mar 24, 2023 23:2126,6654,063,400,5993,999,747,336016,969,728
3Mar 24, 2023 23:2126,6714,074,542,6494,000,695,238016,982,016
4Mar 25, 2023 00:2726,6714,073,761,9534,000,622,331016,977,920
5Mar 25, 2023 00:2726,6844,066,986,1724,002,605,086016,973,824
6Mar 25, 2023 00:2726,6874,059,974,5684,003,075,294016,973,824