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 listJul 29, 2026 18:58anboto1anboto1Score: 2,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 18:582,844436,793,350417,973,0008,655,00016,793,600
2Jul 29, 2026 18:582,844436,683,167418,010,0008,670,00016,793,600
3Jul 29, 2026 18:582,845436,789,906418,171,0008,604,00016,793,600
4Jul 29, 2026 18:582,845436,757,326418,218,0008,659,00016,793,600
5Jul 29, 2026 18:582,846436,875,510418,260,0008,679,00016,793,600
6Jul 29, 2026 18:582,846437,704,287418,301,0008,652,00016,793,600
7Jul 29, 2026 18:582,847437,092,026418,412,0008,669,00016,793,600
8Jul 29, 2026 18:582,847437,033,841418,455,0008,679,00016,793,600
9Jul 29, 2026 18:582,849437,334,492418,722,0008,717,00016,793,600