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:18anboto1anboto1Score: 2,858Success
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:192,845436,832,497413,693,00013,090,00016,793,600
2Jul 29, 2026 17:192,847437,088,806413,976,00013,095,00016,793,600
3Jul 29, 2026 17:192,849437,334,150414,224,00013,161,00016,793,600
4Jul 29, 2026 17:192,856438,957,797415,354,00013,154,00016,793,600
5Jul 29, 2026 17:192,858439,163,060415,495,00013,347,00016,793,600
6Jul 29, 2026 17:192,891443,816,055420,182,00013,544,00016,793,600
7Jul 29, 2026 17:192,902445,490,828421,806,00013,610,00016,793,600
8Jul 29, 2026 17:192,904445,635,547421,814,00013,803,00016,793,600
9Jul 29, 2026 17:192,906446,016,732422,438,00013,568,00016,793,600