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 23:40anboto1anboto1Score: 2,869Success
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 23:412,867440,140,405416,643,00013,412,00016,793,600
2Jul 29, 2026 23:412,867440,261,252416,635,00013,439,00016,793,600
3Jul 29, 2026 23:412,867440,114,294416,605,00013,502,00016,793,600
4Jul 29, 2026 23:412,868440,356,284416,686,00013,615,00016,793,600
5Jul 29, 2026 23:412,869440,323,813416,873,00013,527,00016,793,600
6Jul 29, 2026 23:412,870440,520,571417,181,00013,388,00016,793,600
7Jul 29, 2026 23:412,873441,055,373417,555,00013,517,00016,793,600
8Jul 29, 2026 23:412,874441,187,530417,687,00013,540,00016,793,600
9Jul 29, 2026 23:412,874441,108,342417,606,00013,530,00016,793,600