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:21Kevin 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:221,557244,801,943228,858,0004,728,00016,793,600
2Sep 26, 2026 18:221,558243,334,291229,073,0004,679,00016,793,600
3Sep 26, 2026 18:221,558244,643,560229,040,0004,741,00016,793,600
4Sep 26, 2026 18:221,558245,488,135229,075,0004,702,00016,793,600
5Sep 26, 2026 18:221,559244,383,469228,560,0005,407,00016,793,600
6Sep 26, 2026 18:221,561246,008,955229,458,0004,731,00016,793,600
7Sep 26, 2026 18:221,561245,174,366229,393,0004,758,00016,793,600
8Sep 26, 2026 18:221,561247,129,668229,005,0005,273,00016,793,600
9Sep 26, 2026 18:221,563244,614,729229,604,0004,846,00016,793,600