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:46Kevin HeaveyKevin HeaveyScore: 1,569Success
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:471,565243,698,901230,231,0004,654,00016,793,600
2Sep 26, 2026 14:471,567244,011,063230,421,0004,653,00016,793,600
3Sep 26, 2026 14:471,568244,026,015230,630,0004,627,00016,793,600
4Sep 26, 2026 14:471,569244,342,658230,627,0004,791,00016,793,600
5Sep 26, 2026 14:471,569244,234,068230,666,0004,687,00016,793,600
6Sep 26, 2026 14:471,569244,770,719230,110,0005,244,00016,793,600
7Sep 26, 2026 14:471,571244,594,157230,814,0004,855,00016,793,600
8Sep 26, 2026 14:471,571244,608,677230,944,0004,747,00016,793,600
9Sep 26, 2026 14:471,572244,722,392231,098,0004,738,00016,793,600