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 27, 2025 09:13Kirill020708Kirill020708Score: 13,413Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2025 09:1312,9171,971,680,0511,895,659,00041,882,00017,031,168
2Sep 27, 2025 09:1313,1812,004,254,1261,935,276,00041,897,00017,100,800
3Sep 27, 2025 09:1313,2492,020,406,8491,942,458,00044,895,00017,133,568
4Sep 27, 2025 09:1313,4122,037,638,3821,935,006,00076,801,00017,104,896
5Sep 27, 2025 09:1313,4132,042,927,5041,968,053,00043,889,00017,051,648
6Sep 27, 2025 09:1313,6792,087,720,8192,021,973,00029,925,00017,063,936
7Sep 27, 2025 09:1313,6812,082,586,1962,008,268,00043,896,00017,055,744
8Sep 27, 2025 09:1313,6832,085,991,8282,012,520,00039,911,00017,059,840
9Sep 27, 2025 09:1314,9162,271,753,7172,186,554,00050,873,00017,063,936