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 08:03highload-churnerhighload-churnerScore: 2,012Success
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 08:032,008310,735,951293,415,0007,826,00016,793,600
2Oct 19, 2026 08:032,009311,361,090293,511,0007,897,00016,793,600
3Oct 19, 2026 08:032,009310,780,291293,460,0007,893,00016,793,600
4Oct 19, 2026 08:032,009310,849,885293,511,0007,844,00016,793,600
5Oct 19, 2026 08:032,012311,229,883294,027,0007,885,00016,793,600
6Oct 19, 2026 08:032,014313,044,777294,292,0007,914,00016,793,600
7Oct 19, 2026 08:032,014311,563,072294,231,0007,911,00016,793,600
8Oct 19, 2026 08:032,018312,227,107294,618,0008,112,00016,793,600
9Oct 19, 2026 08:032,018312,111,195294,803,0007,916,00016,793,600