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:51highload-churnerhighload-churnerScore: 1,597Success
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:511,580246,477,419231,767,0005,326,00016,019,456
2Oct 19, 2026 13:511,581246,659,693231,904,0005,352,00016,019,456
3Oct 19, 2026 13:511,582246,731,145232,052,0005,378,00016,019,456
4Oct 19, 2026 13:511,592248,348,535233,563,0005,348,00016,019,456
5Oct 19, 2026 13:511,597249,155,643234,330,0005,345,00016,019,456
6Oct 19, 2026 13:511,599249,320,289234,663,0005,310,00016,019,456
7Oct 19, 2026 13:511,601249,635,845234,963,0005,333,00016,019,456
8Oct 19, 2026 13:511,603250,060,035235,308,0005,283,00016,019,456
9Oct 19, 2026 13:511,609250,741,556236,036,0005,361,00016,019,456