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 19, 2026 13:59highload-churnerhighload-churnerScore: 1,570Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 14:001,565244,124,850229,833,0004,944,00016,019,456
2Oct 19, 2026 14:001,568244,753,123230,355,0004,985,00016,019,456
3Oct 19, 2026 14:001,568244,697,432230,205,0005,045,00016,019,456
4Oct 19, 2026 14:001,568244,784,959230,306,0005,015,00016,019,456
5Oct 19, 2026 14:001,570244,916,175230,675,0004,973,00016,019,456
6Oct 19, 2026 14:001,575245,846,067231,299,0005,024,00016,019,456
7Oct 19, 2026 14:001,577245,895,010231,596,0004,977,00016,019,456
8Oct 19, 2026 14:001,578246,241,647231,882,0004,965,00016,019,456
9Oct 19, 2026 14:001,582246,706,281232,402,0004,983,00016,019,456