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 listNov 20, 2025 00:42izotoffizotoffScore: 13,183Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2025 00:4213,1562,001,023,7551,947,438,00025,979,00017,113,088
2Nov 20, 2025 00:4213,1622,001,962,7611,951,254,00022,991,00016,953,344
3Nov 20, 2025 00:4213,1642,005,146,1241,952,578,00021,984,00016,977,920
4Nov 20, 2025 00:4213,1811,998,036,8081,950,160,00026,988,00016,953,344
5Nov 20, 2025 00:4213,1832,005,957,9181,952,407,00024,992,00016,949,248
6Nov 20, 2025 00:4213,1882,006,199,9261,953,241,00024,990,00016,969,728
7Nov 20, 2025 00:4213,1902,002,966,1001,953,564,00024,981,00016,969,728
8Nov 20, 2025 00:4213,1932,002,714,2381,950,955,00027,985,00016,965,632
9Nov 20, 2025 00:4213,1982,009,904,0401,955,684,00023,983,00016,936,960