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 17:26anboto1anboto1Score: 2,883Success
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 17:272,875441,229,771418,122,00013,159,00016,793,600
2Jul 29, 2026 17:272,875441,471,238418,274,00013,011,00016,793,600
3Jul 29, 2026 17:272,877441,683,255418,626,00013,021,00016,793,600
4Jul 29, 2026 17:272,881442,936,662419,138,00013,100,00016,793,600
5Jul 29, 2026 17:272,883443,221,165419,385,00013,110,00016,793,600
6Jul 29, 2026 17:272,884442,619,343419,456,00013,168,00016,793,600
7Jul 29, 2026 17:272,886442,900,686419,766,00013,143,00016,793,600
8Jul 29, 2026 17:272,921448,327,020424,791,00013,480,00016,793,600
9Jul 29, 2026 17:272,962463,231,760431,108,00013,240,00016,793,600