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 listSep 26, 2026 14:53Kevin HeaveyKevin HeaveyScore: 1,560Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 14:541,559243,619,605229,268,0004,709,00016,793,600
2Sep 26, 2026 14:541,559242,737,399229,283,0004,676,00016,793,600
3Sep 26, 2026 14:541,559242,860,698229,189,0004,686,00016,793,600
4Sep 26, 2026 14:541,559242,666,638229,160,0004,692,00016,793,600
5Sep 26, 2026 14:541,560242,864,121229,166,0004,849,00016,793,600
6Sep 26, 2026 14:541,560243,795,995229,432,0004,679,00016,793,600
7Sep 26, 2026 14:541,562243,401,373229,677,0004,756,00016,793,600
8Sep 26, 2026 14:541,562243,389,296229,681,0004,748,00016,793,600
9Sep 26, 2026 14:541,563243,278,658229,713,0004,742,00016,793,600