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 listOct 9, 2026 07:39Karthik ReddyKarthik ReddyScore: 1,573Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 07:401,561243,217,933229,943,0004,275,00016,793,600
2Oct 9, 2026 07:401,563244,223,044230,260,0004,233,00016,793,600
3Oct 9, 2026 07:401,566243,868,574230,672,0004,270,00016,793,600
4Oct 9, 2026 07:401,571244,664,806231,476,0004,209,00016,793,600
5Oct 9, 2026 07:401,573244,944,763231,748,0004,227,00016,793,600
6Oct 9, 2026 07:401,573245,110,299231,779,0004,235,00016,793,600
7Oct 9, 2026 07:401,574245,202,649231,934,0004,278,00016,793,600
8Oct 9, 2026 07:401,575245,236,627232,022,0004,245,00016,793,600
9Oct 9, 2026 07:401,582246,335,847233,067,0004,326,00016,793,600