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 16:18anboto1anboto1Score: 2,932Success
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 16:192,927449,220,581430,420,0008,667,00016,793,600
2Jul 29, 2026 16:192,928449,939,790430,487,0008,790,00016,793,600
3Jul 29, 2026 16:192,929449,511,732430,741,0008,757,00016,793,600
4Jul 29, 2026 16:192,932449,888,591430,863,0009,033,00016,793,600
5Jul 29, 2026 16:192,932455,739,868431,170,0008,708,00016,793,600
6Jul 29, 2026 16:192,932449,768,149431,110,0008,700,00016,793,600
7Jul 29, 2026 16:192,933450,002,935431,339,0008,656,00016,793,600
8Jul 29, 2026 16:192,936450,453,404431,751,0008,734,00016,793,600
9Jul 29, 2026 16:192,943451,712,582432,723,0008,737,00016,793,600