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 07:12Karthik ReddyKarthik ReddyScore: 1,576Success
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 07:121,567244,267,696230,027,0005,076,00016,793,600
2Oct 9, 2026 07:121,572244,906,837231,629,0004,222,00016,793,600
3Oct 9, 2026 07:121,576245,528,296232,235,0004,226,00016,793,600
4Oct 9, 2026 07:121,576245,555,868232,249,0004,235,00016,793,600
5Oct 9, 2026 07:121,576245,470,368232,118,0004,288,00016,793,600
6Oct 9, 2026 07:121,593248,066,007234,798,0004,218,00016,793,600
7Oct 9, 2026 07:121,595248,342,394235,114,0004,235,00016,793,600
8Oct 9, 2026 07:121,598248,860,506235,586,0004,239,00016,793,600
9Oct 9, 2026 07:121,606250,528,962236,685,0004,247,00016,793,600