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 listMay 10, 2024 15:30Joad NacerJoad NacerScore: 4,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2024 15:304,310706,235,018646,552,001016,990,208
2May 10, 2024 15:304,311714,037,284646,667,671016,990,208
3May 10, 2024 15:304,316700,593,755647,421,867016,859,136
4May 10, 2024 15:304,345679,299,503609,789,00041,985,00017,158,144
5May 10, 2024 15:304,348678,366,218602,208,00050,017,00017,149,952
6May 10, 2024 15:304,350682,034,290604,483,00047,959,00017,145,856
7May 10, 2024 15:304,350675,913,866608,418,00044,030,00017,154,048
8May 10, 2024 15:304,350675,011,865603,519,00048,961,00017,190,912
9May 10, 2024 15:304,354673,482,958613,122,00040,007,00017,154,048
10May 10, 2024 15:304,355685,241,799614,199,00039,012,00017,010,688
11May 10, 2024 15:304,359685,700,837607,818,00045,986,00016,969,728
12May 10, 2024 15:304,359678,812,932606,910,00046,993,00017,162,240