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 17:22Karthik ReddyKarthik ReddyScore: 1,565Success
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 17:401,557242,669,245229,425,0004,216,00016,793,600
2Oct 9, 2026 17:401,559242,951,735229,728,0004,244,00016,793,600
3Oct 9, 2026 17:401,559242,946,636229,741,0004,199,00016,793,600
4Oct 9, 2026 17:401,560242,961,209229,836,0004,218,00016,793,600
5Oct 9, 2026 17:401,565243,809,020230,636,0004,206,00016,793,600
6Oct 9, 2026 17:401,565243,851,287230,662,0004,213,00016,793,600
7Oct 9, 2026 17:401,566244,055,937229,957,0004,963,00016,793,600
8Oct 9, 2026 17:401,566243,995,006230,776,0004,242,00016,793,600
9Oct 9, 2026 17:401,573245,648,156230,801,0005,181,00016,793,600