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,122Success
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:282,119327,182,986307,495,00010,413,00016,793,600
2Oct 17, 2026 05:282,119327,935,771307,484,00010,465,00016,793,600
3Oct 17, 2026 05:282,121327,499,908307,751,00010,427,00016,793,600
4Oct 17, 2026 05:282,121327,651,345307,794,00010,486,00016,793,600
5Oct 17, 2026 05:282,122327,707,064307,135,00011,312,00016,793,600
6Oct 17, 2026 05:282,125328,113,701308,291,00010,552,00016,793,600
7Oct 17, 2026 05:282,127328,265,686308,532,00010,520,00016,793,600
8Oct 17, 2026 05:282,132328,983,332309,278,00010,528,00016,793,600
9Oct 17, 2026 05:282,149331,568,968311,832,00010,578,00016,793,600