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 17:27anboto1anboto1Score: 2,605Success
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 17:272,602400,952,849380,066,00010,348,00016,793,600
2Jul 29, 2026 17:272,604400,764,424380,343,00010,314,00016,793,600
3Jul 29, 2026 17:272,604400,784,459380,375,00010,359,00016,793,600
4Jul 29, 2026 17:272,605401,240,808380,433,00010,356,00016,793,600
5Jul 29, 2026 17:272,605400,802,687380,428,00010,376,00016,793,600
6Jul 29, 2026 17:272,605400,736,293380,443,00010,307,00016,793,600
7Jul 29, 2026 17:272,606401,044,356380,589,00010,406,00016,793,600
8Jul 29, 2026 17:272,608401,425,563380,947,00010,396,00016,793,600
9Jul 29, 2026 17:272,616402,386,090382,050,00010,426,00016,793,600