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 listJun 24, 2026 10:58anboto1anboto1Score: 6,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 11:006,439975,223,796945,957,00019,935,00016,793,600
2Jun 24, 2026 11:006,445976,044,813947,315,00019,475,00016,793,600
3Jun 24, 2026 11:006,447978,304,089947,384,00019,751,00016,793,600
4Jun 24, 2026 11:006,450976,864,108947,560,00020,007,00016,793,600
5Jun 24, 2026 11:006,464978,971,771949,635,00020,061,00016,797,696
6Jun 24, 2026 11:006,466979,273,678950,686,00019,357,00016,793,600
7Jun 24, 2026 11:006,470979,852,848950,994,00019,566,00016,793,600
8Jun 24, 2026 11:006,478981,111,992951,848,00019,999,00016,793,600
9Jun 24, 2026 11:006,9611,053,420,3611,024,599,00019,592,00016,793,600