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 15:40Karthik 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 16:161,558242,821,677229,533,0004,283,00016,793,600
2Oct 9, 2026 16:161,559242,954,591229,478,0004,431,00016,793,600
3Oct 9, 2026 16:161,559242,961,787229,740,0004,216,00016,793,600
4Oct 9, 2026 16:161,560243,078,884229,809,0004,286,00016,793,600
5Oct 9, 2026 16:161,560242,959,507229,748,0004,284,00016,793,600
6Oct 9, 2026 16:161,563243,504,950230,268,0004,288,00016,793,600
7Oct 9, 2026 16:161,567244,275,310229,841,0005,240,00016,793,600
8Oct 9, 2026 16:161,574245,719,460231,868,0004,303,00016,793,600
9Oct 9, 2026 16:161,575245,403,128231,055,0005,289,00016,793,600