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 12:42highload-churnerhighload-churnerScore: 1,581Success
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 12:421,577246,108,601230,879,0005,732,00016,019,456
2Oct 19, 2026 12:421,577246,083,772230,952,0005,737,00016,019,456
3Oct 19, 2026 12:421,578246,121,149231,069,0005,706,00016,019,456
4Oct 19, 2026 12:421,579246,138,844231,135,0005,724,00016,019,456
5Oct 19, 2026 12:421,581246,560,815231,472,0005,766,00016,019,456
6Oct 19, 2026 12:421,581246,611,759231,472,0005,709,00016,019,456
7Oct 19, 2026 12:421,581246,880,351231,514,0005,725,00016,019,456
8Oct 19, 2026 12:421,582246,813,732231,680,0005,739,00016,019,456
9Oct 19, 2026 12:421,584246,989,363231,881,0005,773,00016,019,456