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 listMar 21, 2026 14:04limanjun99limanjun99Score: 6,853Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 14:046,8511,053,936,8531,010,634,00016,993,00016,986,112
2Mar 21, 2026 14:046,8531,055,410,6071,013,021,00014,985,00016,994,304
3Mar 21, 2026 14:046,8541,052,741,9991,008,092,00019,982,00016,982,016