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 7, 2024 00:32Huy Duc LeHuy Duc LeScore: 3,022Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2024 00:322,964515,446,731444,645,471016,965,632
2Mar 7, 2024 00:322,975506,431,315446,275,680016,969,728
3Mar 7, 2024 00:322,982510,396,885447,226,701016,961,536
4Mar 7, 2024 00:323,018476,165,462422,663,00029,976,00017,108,992
5Mar 7, 2024 00:323,018475,093,605425,687,00026,980,00017,027,072
6Mar 7, 2024 00:323,018476,484,262414,738,00037,976,00017,027,072
7Mar 7, 2024 00:323,022480,709,067424,254,00029,017,00017,031,168
8Mar 7, 2024 00:323,024485,311,837422,567,00030,968,00017,018,880
9Mar 7, 2024 00:323,024481,058,318423,643,00029,974,00017,149,952
10Mar 7, 2024 00:323,026481,910,943421,867,00031,989,00017,027,072
11Mar 7, 2024 00:323,033479,642,015421,891,00032,991,00017,006,592
12Mar 7, 2024 00:323,033482,859,195422,911,00031,993,00017,162,240