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 17:22Karthik 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 17:411,558242,571,872229,624,0004,195,00016,793,600
2Oct 9, 2026 17:411,559242,702,432229,700,0004,190,00016,793,600
3Oct 9, 2026 17:411,559242,723,760229,738,0004,254,00016,793,600
4Oct 9, 2026 17:411,559242,661,525229,755,0004,196,00016,793,600
5Oct 9, 2026 17:411,561243,169,028229,931,0004,253,00016,793,600
6Oct 9, 2026 17:411,562243,175,021230,170,0004,258,00016,793,600
7Oct 9, 2026 17:411,562243,075,079230,070,0004,282,00016,793,600
8Oct 9, 2026 17:411,564243,432,012230,456,0004,238,00016,793,600
9Oct 9, 2026 17:411,568244,171,885231,112,0004,214,00016,793,600