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 listDec 31, 2025 23:57Josu San MartinJosu San MartinScore: 13,437Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 23:5713,3862,037,080,0321,931,115,00076,845,00016,973,824
2Dec 31, 2025 23:5713,4292,041,836,3621,823,793,000190,560,00016,982,016
3Dec 31, 2025 23:5713,4342,041,122,7281,880,368,000134,668,00017,190,912
4Dec 31, 2025 23:5713,4362,049,925,8451,878,691,000136,686,00017,125,376
5Dec 31, 2025 23:5713,4372,050,536,5441,861,830,000153,655,00017,158,144
6Dec 31, 2025 23:5713,4372,049,153,5781,865,919,000149,672,00017,055,744
7Dec 31, 2025 23:5713,4432,045,688,7461,881,818,000134,700,00017,063,936
8Dec 31, 2025 23:5713,4462,047,507,6361,848,259,000168,567,00017,059,840
9Dec 31, 2025 23:5714,4252,192,046,2022,119,888,00043,894,00016,961,536