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,432Success
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,2332,010,442,3311,943,005,00041,913,00017,018,880
2Dec 31, 2025 23:5713,4282,047,133,2641,871,542,000142,660,00017,018,880
3Dec 31, 2025 23:5713,4292,046,089,2731,837,697,000176,586,00016,961,536
4Dec 31, 2025 23:5713,4292,040,724,5821,807,812,000206,521,00017,018,880
5Dec 31, 2025 23:5713,4322,041,236,6771,860,083,000154,674,00017,088,512
6Dec 31, 2025 23:5713,4342,040,945,4571,873,512,000141,660,00017,018,880
7Dec 31, 2025 23:5713,4422,044,783,4871,891,533,000124,705,00017,022,976
8Dec 31, 2025 23:5714,7552,244,150,5252,175,329,00037,901,00017,063,936
9Dec 31, 2025 23:5714,7922,243,685,7382,185,852,00032,922,00016,961,536