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 18, 2026 17:05M-RochatM-RochatScore: 4,192Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 17:064,160636,235,570602,059,00022,074,00016,793,600
2May 18, 2026 17:064,166634,642,745602,920,00022,073,00016,793,600
3May 18, 2026 17:064,168635,489,433603,553,00021,712,00016,793,600
4May 18, 2026 17:064,169635,961,665602,742,00022,622,00016,793,600
5May 18, 2026 17:064,192645,742,961606,872,00021,964,00016,793,600
6May 18, 2026 17:064,194641,420,032607,433,00021,793,00016,793,600
7May 18, 2026 17:064,194640,991,463607,311,00021,845,00016,793,600
8May 18, 2026 17:064,195644,420,034607,348,00021,960,00016,793,600
9May 18, 2026 17:064,197640,079,866607,743,00021,840,00016,793,600