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 listMar 22, 2026 19:41Dominique GarmierDominique GarmierScore: 252,397Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 19:41252,28637,890,166,83537,828,902,00013,991,00016,961,536
2Mar 22, 2026 18:10252,34537,892,774,98937,836,746,00014,991,00016,953,344
3Mar 22, 2026 18:10252,38337,923,179,80237,842,514,00014,991,00016,953,344
4Mar 22, 2026 18:10252,39737,910,753,08037,841,577,00017,990,00016,953,344
5Mar 22, 2026 19:41252,39837,908,178,01637,845,674,00013,991,00016,953,344
6Mar 22, 2026 19:41252,39837,906,909,39137,844,719,00014,991,00016,961,536