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 9, 2026 14:27Karthik ReddyKarthik ReddyScore: 1,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 14:431,558242,693,575229,494,0004,206,00016,793,600
2Oct 9, 2026 14:431,558242,787,393229,549,0004,238,00016,793,600
3Oct 9, 2026 14:431,558242,637,920229,507,0004,206,00016,793,600
4Oct 9, 2026 14:431,558243,296,619229,496,0004,264,00016,793,600
5Oct 9, 2026 14:431,559242,817,099229,652,0004,236,00016,793,600
6Oct 9, 2026 14:431,560242,998,395229,834,0004,231,00016,793,600
7Oct 9, 2026 14:431,561243,193,641230,007,0004,225,00016,793,600
8Oct 9, 2026 14:431,571244,747,871231,571,0004,227,00016,793,600
9Oct 9, 2026 14:431,573245,008,799231,736,0004,293,00016,793,600