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 15, 2026 23:09izotoffizotoffScore: 2,094Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 23:112,086324,239,236303,851,0009,140,00016,818,176
2Oct 15, 2026 23:112,091325,209,304304,094,0009,580,00016,818,176
3Oct 15, 2026 23:112,091325,147,318304,471,0009,194,00016,818,176
4Oct 15, 2026 23:112,093325,859,649304,795,0009,236,00016,818,176
5Oct 15, 2026 23:112,094327,684,496304,581,0009,564,00016,818,176
6Oct 15, 2026 23:112,095326,192,237305,080,0009,314,00016,818,176
7Oct 15, 2026 23:112,095327,503,256305,030,0009,278,00016,818,176
8Oct 15, 2026 23:112,097326,257,239305,236,0009,436,00016,818,176
9Oct 15, 2026 23:112,108327,635,090307,075,0009,240,00016,818,176