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:41Karthik ReddyKarthik ReddyScore: 1,560Success
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 12:591,558242,707,515229,564,0004,224,00016,793,600
2Oct 9, 2026 12:591,558242,817,625229,625,0004,215,00016,793,600
3Oct 9, 2026 12:591,559242,851,859229,687,0004,236,00016,793,600
4Oct 9, 2026 12:591,559242,907,363229,694,0004,269,00016,793,600
5Oct 9, 2026 12:591,560242,987,720229,876,0004,236,00016,793,600
6Oct 9, 2026 12:591,566244,060,172230,783,0004,232,00016,793,600
7Oct 9, 2026 12:591,574245,879,689231,953,0004,257,00016,793,600
8Oct 9, 2026 12:591,575245,377,410232,038,0004,294,00016,793,600
9Oct 9, 2026 12:591,577245,656,604232,347,0004,284,00016,793,600