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 20:59anboto1anboto1Score: 3,146Success
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 21:003,140481,364,487458,009,00013,051,00016,793,600
2Jul 29, 2026 21:003,141481,224,550457,681,00013,483,00016,793,600
3Jul 29, 2026 21:003,141481,306,703457,774,00013,525,00016,793,600
4Jul 29, 2026 21:003,143481,464,162457,925,00013,536,00016,793,600
5Jul 29, 2026 21:003,146482,622,573458,383,00013,519,00016,793,600
6Jul 29, 2026 21:003,146482,042,444458,603,00013,398,00016,793,600
7Jul 29, 2026 21:003,148482,325,815458,663,00013,660,00016,793,600
8Jul 29, 2026 21:003,150482,588,815458,913,00013,723,00016,793,600
9Jul 29, 2026 21:003,151482,588,761459,129,00013,537,00016,793,600