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 13, 2026 20:12Karthik ReddyKarthik ReddyScore: 1,562Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 20:161,558242,515,748229,488,0004,217,00016,793,600
2Oct 13, 2026 20:161,558242,456,473229,513,0004,200,00016,793,600
3Oct 13, 2026 20:161,560243,594,229229,870,0004,264,00016,793,600
4Oct 13, 2026 20:161,561242,952,313229,936,0004,227,00016,793,600
5Oct 13, 2026 20:161,562243,188,835230,082,0004,291,00016,793,600
6Oct 13, 2026 20:161,563243,071,990230,192,0004,306,00016,793,600
7Oct 13, 2026 20:161,564247,368,542230,327,0004,311,00016,793,600
8Oct 13, 2026 20:161,577245,570,163232,398,0004,265,00016,793,600
9Oct 13, 2026 20:161,581245,888,183232,961,0004,241,00016,793,600