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 listJul 13, 2023 00:01gchebanovgchebanovScore: 3,662Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2023 00:013,605601,290,626540,717,176017,002,496
2Jul 13, 2023 00:013,607618,543,253541,062,709016,998,400
3Jul 13, 2023 00:013,609597,221,927541,412,931016,990,208
4Jul 13, 2023 00:013,660573,843,946521,010,00028,000,00017,141,760
5Jul 13, 2023 00:013,661571,269,537519,074,00030,004,00016,957,440
6Jul 13, 2023 00:013,661571,976,903517,121,00032,007,00017,141,760
7Jul 13, 2023 00:013,662576,150,540518,249,00031,014,00017,068,032
8Jul 13, 2023 00:013,663574,545,301517,438,00031,965,00017,145,856
9Jul 13, 2023 00:013,669577,102,425520,261,00030,015,00017,154,048
10Jul 13, 2023 00:013,673574,722,197520,926,00029,995,00017,141,760
11Jul 13, 2023 00:013,673581,494,369517,992,00032,999,00017,145,856
12Jul 13, 2023 00:013,678574,294,313521,729,00029,984,00016,986,112