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 18:19Kevin HeaveyKevin HeaveyScore: 1,559Success
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 18:191,557243,131,379229,000,0004,676,00016,793,600
2Sep 26, 2026 18:191,557243,408,177228,930,0004,653,00016,793,600
3Sep 26, 2026 18:191,558243,352,649229,106,0004,670,00016,793,600
4Sep 26, 2026 18:191,558243,427,788229,112,0004,682,00016,793,600
5Sep 26, 2026 18:191,559243,411,281229,237,0004,698,00016,793,600
6Sep 26, 2026 18:191,559243,342,197229,183,0004,682,00016,793,600
7Sep 26, 2026 18:191,560243,618,921229,317,0004,743,00016,793,600
8Sep 26, 2026 18:191,562243,871,935229,628,0004,733,00016,793,600
9Sep 26, 2026 18:191,562244,073,711229,606,0004,749,00016,793,600