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:58highload-churnerhighload-churnerScore: 1,544Success
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 13:591,541240,745,820226,218,0005,006,00016,019,456
2Oct 19, 2026 13:591,542240,762,663226,382,0004,983,00016,019,456
3Oct 19, 2026 13:591,543240,907,202226,548,0004,971,00016,019,456
4Oct 19, 2026 13:591,544241,389,764226,607,0005,011,00016,019,456
5Oct 19, 2026 13:591,544241,097,477226,708,0004,956,00016,019,456
6Oct 19, 2026 13:591,545241,190,234226,847,0005,019,00016,019,456
7Oct 19, 2026 13:591,545241,290,338226,827,0005,002,00016,019,456
8Oct 19, 2026 13:591,548241,649,946227,234,0005,003,00016,019,456
9Oct 19, 2026 13:591,549241,830,799227,326,0005,034,00016,019,456