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:06highload-churnerhighload-churnerScore: 2,717Success
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:282,712415,889,334381,857,00025,061,00016,797,696
2Oct 9, 2026 16:282,712416,396,615380,946,00025,892,00016,797,696
3Oct 9, 2026 16:282,714416,153,522381,894,00025,250,00016,797,696
4Oct 9, 2026 16:282,716416,451,450380,745,00026,656,00016,797,696
5Oct 9, 2026 16:282,717416,673,166381,055,00026,549,00016,797,696
6Oct 9, 2026 16:282,719417,468,969381,993,00025,959,00016,797,696
7Oct 9, 2026 16:282,722417,435,564382,317,00026,052,00016,797,696
8Oct 9, 2026 16:282,728418,821,381383,155,00026,049,00016,797,696
9Oct 9, 2026 16:282,749421,401,257385,569,00026,841,00016,797,696