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:05e1011e1011Score: 56,199Success
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:0756,1958,440,213,1918,412,332,00017,004,00016,793,600
2Oct 21, 2026 06:0756,1978,440,549,7868,412,510,00017,159,00016,793,600
3Oct 21, 2026 06:0756,1978,440,953,8048,412,232,00017,463,00016,793,600
4Oct 21, 2026 06:0756,1978,440,565,1648,412,560,00017,034,00016,793,600
5Oct 21, 2026 06:0756,1998,441,259,5288,412,581,00017,414,00016,793,600
6Oct 21, 2026 06:0756,2008,440,988,7278,413,121,00016,885,00016,793,600
7Oct 21, 2026 06:0756,2348,446,499,3158,418,373,00016,781,00016,793,600
8Oct 21, 2026 06:0756,2378,446,927,6788,418,251,00017,439,00016,793,600
9Oct 21, 2026 06:0756,2428,447,209,2448,419,418,00016,951,00016,793,600