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:07highload-churnerhighload-churnerScore: 1,542Success
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:071,539240,345,896226,237,0004,662,00016,019,456
2Nov 8, 2026 05:071,539241,188,080226,308,0004,668,00016,019,456
3Nov 8, 2026 05:071,540240,368,985226,481,0004,667,00016,019,456
4Nov 8, 2026 05:071,542240,701,386226,610,0004,721,00016,019,456
5Nov 8, 2026 05:071,542240,668,629226,725,0004,676,00016,019,456
6Nov 8, 2026 05:071,542240,797,768226,168,0005,134,00016,019,456
7Nov 8, 2026 05:071,543241,008,121226,821,0004,694,00016,019,456
8Nov 8, 2026 05:071,543240,734,106226,856,0004,675,00016,019,456
9Nov 8, 2026 05:071,543240,952,867226,729,0004,790,00016,019,456