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 listMay 14, 2026 16:51Josu San MartinJosu San MartinScore: 13,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 17:0213,5822,046,600,5822,006,108,00031,196,00016,793,600
2May 14, 2026 17:0213,5832,045,966,2442,009,622,00027,935,00016,793,600
3May 14, 2026 17:0213,5902,046,111,2932,007,655,00030,856,00016,793,600
4May 14, 2026 17:0213,6042,047,971,9822,011,466,00029,230,00016,793,600
5May 14, 2026 17:0213,6112,049,082,3062,011,467,00030,270,00016,793,600
6May 14, 2026 17:0213,6902,060,843,4802,023,260,00030,260,00016,793,600
7May 14, 2026 17:0213,7042,063,213,4342,026,802,00028,802,00016,793,600
8May 14, 2026 17:0213,7332,068,910,1142,030,513,00029,480,00016,793,600
9May 14, 2026 17:0215,2812,299,540,5812,265,202,00026,965,00016,793,600