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 listOct 21, 2026 06:06e1011e1011Score: 56,211Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2026 06:0856,1958,440,522,3328,412,036,00017,285,00016,793,600
2Oct 21, 2026 06:0856,1968,440,324,9878,412,580,00016,867,00016,793,600
3Oct 21, 2026 06:0856,1978,440,553,5228,412,555,00017,060,00016,793,600
4Oct 21, 2026 06:0856,2008,441,178,7318,413,185,00016,962,00016,793,600
5Oct 21, 2026 06:0856,2118,443,026,8278,414,732,00016,935,00016,793,600
6Oct 21, 2026 06:0856,2288,445,312,7498,417,323,00016,960,00016,793,600
7Oct 21, 2026 06:0856,2318,445,783,4988,417,567,00017,110,00016,793,600
8Oct 21, 2026 06:0856,2338,446,015,3668,418,054,00017,016,00016,793,600
9Oct 21, 2026 06:0856,2428,448,049,8568,418,307,00018,120,00016,793,600