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:14gchebanovgchebanovScore: 3,441Success
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:143,388587,294,885508,168,741016,990,208
2Jul 13, 2023 00:143,391562,655,891508,584,040016,982,016
3Jul 13, 2023 00:143,399592,857,519509,858,495016,986,112
4Jul 13, 2023 00:143,433540,583,156485,996,00028,999,00017,006,592
5Jul 13, 2023 00:143,434542,690,887488,107,00027,005,00017,121,280
6Jul 13, 2023 00:143,438543,482,870488,694,00026,983,00017,002,496
7Jul 13, 2023 00:143,441543,370,768488,206,00028,011,00017,010,688
8Jul 13, 2023 00:143,442546,107,755489,403,00026,967,00017,100,800
9Jul 13, 2023 00:143,447543,544,991487,993,00028,999,00016,961,536
10Jul 13, 2023 00:143,449543,161,025489,403,00027,965,00017,006,592
11Jul 13, 2023 00:143,449544,047,811488,411,00028,965,00017,088,512
12Jul 13, 2023 00:143,452542,968,518488,811,00028,988,00017,010,688