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 13:30Karthik ReddyKarthik ReddyScore: 1,561Success
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:561,558242,630,684229,551,0004,274,00016,793,600
2Oct 9, 2026 13:561,559242,795,017228,838,0005,060,00016,793,600
3Oct 9, 2026 13:561,560242,856,197229,821,0004,204,00016,793,600
4Oct 9, 2026 13:561,560242,663,475229,787,0004,221,00016,793,600
5Oct 9, 2026 13:561,561244,638,767229,777,0004,394,00016,793,600
6Oct 9, 2026 13:561,570244,313,425231,410,0004,215,00016,793,600
7Oct 9, 2026 13:561,570244,264,222231,275,0004,283,00016,793,600
8Oct 9, 2026 13:561,573246,337,824231,742,0004,303,00016,793,600
9Oct 9, 2026 13:561,573245,187,906231,693,0004,262,00016,793,600