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 listFeb 10, 2025 07:02NoSIMD_C#NoSIMD_C#Score: 56,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2025 07:0254,6018,228,679,3888,141,301,00048,893,00017,088,512
2Feb 10, 2025 07:0256,4108,495,337,0308,422,598,00038,951,00016,998,400
3Feb 10, 2025 07:0257,1598,606,731,6578,543,859,00029,960,00017,149,952