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 listMay 22, 2026 23:06M-RochatM-RochatScore: 4,575Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 23:064,497685,209,603653,053,00021,514,00016,793,600
2May 22, 2026 23:064,501685,085,639653,614,00021,542,00016,793,600
3May 22, 2026 23:064,507687,803,360654,667,00021,481,00016,793,600
4May 22, 2026 23:064,537691,646,978659,369,00021,222,00016,793,600
5May 22, 2026 23:064,575696,579,795665,437,00020,954,00016,793,600
6May 22, 2026 23:064,606701,594,666669,919,00021,059,00016,793,600
7May 22, 2026 23:064,618703,825,314671,865,00020,864,00016,793,600
8May 22, 2026 23:064,618703,554,554671,955,00020,852,00016,793,600
9May 22, 2026 23:064,620702,624,645672,074,00020,939,00016,793,600