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 16:05highload-churnerhighload-churnerScore: 2,694Success
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 16:252,689412,938,252376,570,00026,796,00016,797,696
2Oct 9, 2026 16:252,689412,575,373377,478,00026,000,00016,797,696
3Oct 9, 2026 16:252,691412,700,872377,166,00026,563,00016,797,696
4Oct 9, 2026 16:252,692413,528,197377,307,00026,568,00016,797,696
5Oct 9, 2026 16:252,694413,135,146377,956,00026,153,00016,797,696
6Oct 9, 2026 16:252,694413,279,770378,069,00026,136,00016,797,696
7Oct 9, 2026 16:252,697413,595,948378,418,00026,136,00016,797,696
8Oct 9, 2026 16:252,713415,984,229381,345,00025,615,00016,797,696
9Oct 9, 2026 16:252,733418,999,398384,593,00025,421,00016,797,696