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 10:42Karthik ReddyKarthik ReddyScore: 1,559Success
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 10:581,557242,623,547229,451,0004,218,00016,793,600
2Oct 9, 2026 10:581,558242,884,377229,556,0004,250,00016,793,600
3Oct 9, 2026 10:581,558242,701,318229,494,0004,226,00016,793,600
4Oct 9, 2026 10:581,559242,875,361229,702,0004,222,00016,793,600
5Oct 9, 2026 10:581,559242,838,584229,674,0004,220,00016,793,600
6Oct 9, 2026 10:581,561243,215,446230,029,0004,258,00016,793,600
7Oct 9, 2026 10:581,561243,757,887229,969,0004,240,00016,793,600
8Oct 9, 2026 10:581,566244,047,901230,723,0004,314,00016,793,600
9Oct 9, 2026 10:581,571244,734,082231,478,0004,217,00016,793,600