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 listApr 4, 2025 08:27NoSIMD_C#NoSIMD_C#Score: 105,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 4, 2025 08:27104,77515,752,211,97815,662,299,00053,956,00017,059,840
2Apr 4, 2025 08:27105,00015,791,150,82115,699,013,00050,961,00017,088,512
3Apr 4, 2025 08:27105,52015,869,174,17715,765,979,00061,952,00017,215,488