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 listSep 3, 2024 16:51AnSaAnSaScore: 12,612Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2024 16:5112,3561,883,381,5341,840,447,00012,967,00016,384,000
2Sep 3, 2024 16:5112,5111,906,099,6181,868,651,0007,981,00016,351,232
3Sep 3, 2024 16:5112,5661,917,217,5191,875,853,0008,980,00016,318,464
4Sep 3, 2024 16:5112,5761,920,265,7121,877,487,0008,983,00016,412,672
5Sep 3, 2024 16:5112,6121,922,231,4051,882,758,0008,979,00016,244,736
6Sep 3, 2024 16:5112,6331,927,086,4341,885,006,0009,973,00016,384,000
7Sep 3, 2024 16:5112,6551,926,210,1051,889,250,0008,982,00016,338,944
8Sep 3, 2024 16:5113,4792,052,130,9442,016,875,0004,987,00016,179,200
9Sep 3, 2024 16:5113,5262,059,313,1552,020,965,0007,980,00016,293,888