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 9, 2026 12:42Karthik ReddyKarthik ReddyScore: 1,562Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 13:001,559242,585,732229,648,0004,231,00016,793,600
2Oct 9, 2026 13:001,560242,865,837229,616,0004,446,00016,793,600
3Oct 9, 2026 13:001,561243,113,222230,015,0004,263,00016,793,600
4Oct 9, 2026 13:001,561243,119,567229,945,0004,342,00016,793,600
5Oct 9, 2026 13:001,562243,040,469230,159,0004,218,00016,793,600
6Oct 9, 2026 13:001,564243,541,836230,424,0004,241,00016,793,600
7Oct 9, 2026 13:001,573244,715,531231,675,0004,294,00016,793,600
8Oct 9, 2026 13:001,575244,921,708232,041,0004,225,00016,793,600
9Oct 9, 2026 13:001,580245,761,060232,733,0004,294,00016,793,600