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 04:56highload-churnerhighload-churnerScore: 1,548Success
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 04:561,542240,697,233226,292,0005,073,00016,019,456
2Nov 8, 2026 04:561,543240,895,811226,549,0004,983,00016,019,456
3Nov 8, 2026 04:561,546241,648,165226,900,0005,079,00016,019,456
4Nov 8, 2026 04:561,547241,531,401227,049,0005,105,00016,019,456
5Nov 8, 2026 04:561,548241,995,104227,236,0004,975,00016,019,456
6Nov 8, 2026 04:561,549241,771,031227,448,0004,996,00016,019,456
7Nov 8, 2026 04:561,551241,985,020227,620,0005,039,00016,019,456
8Nov 8, 2026 04:561,557242,889,382228,693,0004,969,00016,019,456
9Nov 8, 2026 04:561,564243,916,936229,707,0004,966,00016,019,456