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 30, 2026 00:25anboto1anboto1Score: 3,192Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 00:263,186487,863,057464,498,00013,408,00016,797,696
2Jul 30, 2026 00:263,187488,155,891464,666,00013,526,00016,797,696
3Jul 30, 2026 00:263,188488,317,772464,807,00013,508,00016,797,696
4Jul 30, 2026 00:263,189488,307,124464,891,00013,528,00016,797,696
5Jul 30, 2026 00:263,192489,182,307464,928,00013,960,00016,797,696
6Jul 30, 2026 00:263,194489,178,472465,656,00013,466,00016,797,696
7Jul 30, 2026 00:263,194489,196,561465,471,00013,667,00016,797,696
8Jul 30, 2026 00:263,194489,366,541465,417,00013,723,00016,797,696
9Jul 30, 2026 00:263,199489,908,984466,380,00013,471,00016,797,696