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 17, 2026 05:27highload-churnerhighload-churnerScore: 2,126Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 05:272,120327,341,281307,626,00010,446,00016,793,600
2Oct 17, 2026 05:272,121327,530,625307,760,00010,505,00016,793,600
3Oct 17, 2026 05:272,121327,654,431307,750,00010,544,00016,793,600
4Oct 17, 2026 05:272,121327,558,183307,753,00010,498,00016,793,600
5Oct 17, 2026 05:272,126328,169,382308,418,00010,495,00016,793,600
6Oct 17, 2026 05:272,127328,525,236307,585,00011,510,00016,793,600
7Oct 17, 2026 05:272,129328,653,295307,788,00011,636,00016,793,600
8Oct 17, 2026 05:272,129328,749,599307,765,00011,666,00016,793,600
9Oct 17, 2026 05:272,131328,918,806307,947,00011,795,00016,793,600