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 23:15highload-churnerhighload-churnerScore: 2,558Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 00:562,554392,192,993359,154,00024,001,00016,797,696
2Oct 10, 2026 00:562,556392,432,758359,349,00024,054,00016,797,696
3Oct 10, 2026 00:562,557392,653,000359,383,00024,202,00016,797,696
4Oct 10, 2026 00:562,558394,367,100359,765,00024,068,00016,797,696
5Oct 10, 2026 00:562,558392,687,938359,445,00024,296,00016,797,696
6Oct 10, 2026 00:562,563393,789,802359,945,00024,654,00016,797,696
7Oct 10, 2026 00:562,564393,679,523360,205,00024,493,00016,797,696
8Oct 10, 2026 00:562,567394,172,317360,659,00024,496,00016,797,696
9Oct 10, 2026 00:562,570394,632,207360,633,00024,923,00016,797,696