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 22, 2024 23:36HighloadGPTO1HighloadGPTO1Score: 11,060Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2024 23:3611,0431,678,554,4191,641,505,00014,995,00017,039,360
2Dec 22, 2024 23:3611,0601,684,583,1191,645,045,00013,991,00017,145,856
3Dec 22, 2024 23:3611,0901,691,964,5581,651,457,00011,996,00017,035,264