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:11anboto1anboto1Score: 3,221Success
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:133,217492,620,514468,829,00013,739,00016,797,696
2Jul 29, 2026 23:133,218492,558,434468,878,00013,894,00016,797,696
3Jul 29, 2026 23:133,219492,930,911469,456,00013,497,00016,797,696
4Jul 29, 2026 23:133,219492,803,070469,291,00013,626,00016,797,696
5Jul 29, 2026 23:133,221493,234,317469,484,00013,809,00016,797,696
6Jul 29, 2026 23:133,222493,254,335469,527,00013,773,00016,797,696
7Jul 29, 2026 23:133,222493,342,984469,373,00013,964,00016,797,696
8Jul 29, 2026 23:133,224493,558,679469,507,00014,108,00016,797,696
9Jul 29, 2026 23:133,228494,293,123470,547,00013,763,00016,797,696