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 12, 2023 20:47gchebanovgchebanovScore: 4,538Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2023 20:474,522760,864,095678,346,330016,920,576
2Jul 12, 2023 20:474,524746,192,812678,584,334016,928,768
3Jul 12, 2023 20:474,526700,602,353650,836,00027,992,00017,174,528
4Jul 12, 2023 20:474,531704,062,836655,678,00023,988,00017,178,624
5Jul 12, 2023 20:474,533705,531,985656,998,00022,999,00016,949,248
6Jul 12, 2023 20:474,535706,075,927656,347,00023,976,00017,166,336
7Jul 12, 2023 20:474,538707,635,704653,776,00026,990,00017,121,280
8Jul 12, 2023 20:474,544707,718,114654,544,00026,981,00016,969,728
9Jul 12, 2023 20:474,547710,270,298655,036,00026,960,00017,133,568
10Jul 12, 2023 20:474,548713,841,593653,289,00028,968,00017,190,912
11Jul 12, 2023 20:474,556706,732,009655,427,00027,975,00017,068,032
12Jul 12, 2023 20:474,565763,745,221684,772,496016,920,576