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 16, 2026 16:44M-RochatM-RochatScore: 4,365Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 16:454,329658,272,876628,470,00020,950,00016,793,600
2May 16, 2026 16:454,357664,596,613632,041,00021,613,00016,793,600
3May 16, 2026 16:454,362663,684,958632,595,00021,802,00016,793,600
4May 16, 2026 16:454,364664,120,221632,939,00021,691,00016,793,600
5May 16, 2026 16:454,365663,882,604633,393,00021,381,00016,793,600
6May 16, 2026 16:454,366665,905,583633,677,00021,328,00016,793,600
7May 16, 2026 16:454,369666,026,379633,474,00021,901,00016,793,600
8May 16, 2026 16:454,478680,873,294650,568,00021,210,00016,793,600
9May 16, 2026 16:454,533689,330,923656,877,00023,167,00016,793,600