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 18:03anboto1anboto1Score: 2,549Success
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 18:042,543391,532,432366,711,00014,786,00016,793,600
2Jul 29, 2026 18:042,544391,858,072366,631,00015,062,00016,793,600
3Jul 29, 2026 18:042,547392,281,031367,453,00014,741,00016,793,600
4Jul 29, 2026 18:042,548392,281,106367,314,00014,964,00016,793,600
5Jul 29, 2026 18:042,549393,061,368367,654,00014,765,00016,793,600
6Jul 29, 2026 18:042,549392,541,308367,599,00014,773,00016,793,600
7Jul 29, 2026 18:042,551393,454,329367,850,00014,843,00016,793,600
8Jul 29, 2026 18:042,554393,214,164368,281,00014,852,00016,793,600
9Jul 29, 2026 18:042,604408,994,703375,588,00015,048,00016,793,600