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 22:42anboto1anboto1Score: 4,458Success
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 22:434,449677,455,400652,248,00015,129,00016,793,600
2Jul 29, 2026 22:434,451678,355,656652,615,00015,120,00016,793,600
3Jul 29, 2026 22:434,452678,435,610652,737,00015,107,00016,793,600
4Jul 29, 2026 22:434,455678,544,437653,198,00015,119,00016,793,600
5Jul 29, 2026 22:434,458680,009,945653,497,00015,271,00016,793,600
6Jul 29, 2026 22:434,459679,722,524653,767,00015,206,00016,793,600
7Jul 29, 2026 22:434,469681,101,581655,257,00015,158,00016,793,600
8Jul 29, 2026 22:434,482682,414,436657,382,00015,010,00016,793,600
9Jul 29, 2026 22:434,517687,633,154662,363,00015,214,00016,793,600