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 listNov 8, 2026 05:19highload-churnerhighload-churnerScore: 1,538Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2026 05:191,535239,690,129226,075,0004,315,00016,019,456
2Nov 8, 2026 05:191,536239,904,833226,204,0004,314,00016,019,456
3Nov 8, 2026 05:191,536239,850,948226,189,0004,349,00016,019,456
4Nov 8, 2026 05:191,538240,040,610226,408,0004,309,00016,019,456
5Nov 8, 2026 05:191,538240,165,265226,436,0004,349,00016,019,456
6Nov 8, 2026 05:191,538240,114,787226,406,0004,366,00016,019,456
7Nov 8, 2026 05:191,539240,350,455226,519,0004,435,00016,019,456
8Nov 8, 2026 05:191,540240,623,026226,702,0004,403,00016,019,456
9Nov 8, 2026 05:191,542240,680,839226,980,0004,395,00016,019,456