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 15:54anboto1anboto1Score: 3,146Success
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 15:553,142481,451,696459,445,00011,991,00016,793,600
2Jul 29, 2026 15:553,143481,506,587459,833,00011,691,00016,793,600
3Jul 29, 2026 15:553,143481,514,124460,193,00011,402,00016,793,600
4Jul 29, 2026 15:553,144481,740,980460,294,00011,446,00016,793,600
5Jul 29, 2026 15:553,146481,945,713460,618,00011,353,00016,793,600
6Jul 29, 2026 15:553,147482,120,089460,360,00011,776,00016,793,600
7Jul 29, 2026 15:553,150482,643,621460,665,00011,958,00016,793,600
8Jul 29, 2026 15:553,150482,677,833460,621,00012,012,00016,793,600
9Jul 29, 2026 15:553,161484,338,426462,823,00011,473,00016,793,600