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 listJul 29, 2026 15:27anboto1anboto1Score: 13,462Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 15:2813,4262,023,989,1002,008,567,0005,345,00016,793,600
2Jul 29, 2026 15:2813,4292,024,615,0752,009,225,0005,257,00016,793,600
3Jul 29, 2026 15:2813,4392,030,166,7692,010,625,0005,304,00016,793,600
4Jul 29, 2026 15:2813,4432,026,595,9022,011,216,0005,320,00016,793,600
5Jul 29, 2026 15:2813,4622,029,425,9832,015,106,0004,339,00016,793,600
6Jul 29, 2026 15:2813,4682,031,624,2302,016,088,0004,238,00016,793,600
7Jul 29, 2026 15:2813,4742,031,254,0412,016,903,0004,327,00016,793,600
8Jul 29, 2026 15:2813,5042,035,653,1512,020,460,0005,150,00016,793,600
9Jul 29, 2026 15:2813,6252,053,874,7992,039,675,0004,192,00016,793,600