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 30, 2026 00:01anboto1anboto1Score: 3,289Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 00:113,280502,170,344477,615,00014,481,00016,797,696
2Jul 30, 2026 00:113,281502,358,697477,584,00014,715,00016,797,696
3Jul 30, 2026 00:113,282502,401,607477,859,00014,514,00016,797,696
4Jul 30, 2026 00:113,288503,160,006478,672,00014,580,00016,797,696
5Jul 30, 2026 00:113,289503,489,827478,858,00014,631,00016,797,696
6Jul 30, 2026 00:113,292503,929,991479,136,00014,761,00016,797,696
7Jul 30, 2026 00:113,301505,227,577480,271,00015,009,00016,797,696
8Jul 30, 2026 00:113,302505,435,024480,434,00014,936,00016,797,696
9Jul 30, 2026 00:113,313507,019,817480,943,00016,017,00016,797,696