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:35Kevin HeaveyKevin HeaveyScore: 1,578Success
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:351,576245,460,067230,344,0006,081,00016,793,600
2Sep 26, 2026 14:351,576245,389,535230,497,0006,039,00016,793,600
3Sep 26, 2026 14:351,578245,603,083230,671,0006,055,00016,793,600
4Sep 26, 2026 14:351,578245,611,808230,626,0006,119,00016,793,600
5Sep 26, 2026 14:351,578245,765,902230,597,0006,117,00016,793,600
6Sep 26, 2026 14:351,579245,939,474230,884,0006,104,00016,793,600
7Sep 26, 2026 14:351,581246,128,275231,009,0006,177,00016,793,600
8Sep 26, 2026 14:351,581246,243,082230,017,0007,160,00016,793,600
9Sep 26, 2026 14:351,582246,396,621230,970,0006,342,00016,793,600