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 14:28Karthik ReddyKarthik ReddyScore: 1,563Success
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 14:441,559242,699,561229,691,0004,246,00016,793,600
2Oct 9, 2026 14:441,559245,992,645229,698,0004,217,00016,793,600
3Oct 9, 2026 14:441,561242,993,943230,006,0004,224,00016,793,600
4Oct 9, 2026 14:441,562244,768,904230,106,0004,277,00016,793,600
5Oct 9, 2026 14:441,563243,268,522229,488,0005,084,00016,793,600
6Oct 9, 2026 14:441,571244,586,737231,454,0004,285,00016,793,600
7Oct 9, 2026 14:441,606252,532,340234,131,0006,870,00016,793,600
8Oct 9, 2026 14:441,606255,815,030236,527,0004,466,00016,793,600
9Oct 9, 2026 14:441,620260,725,329234,417,0008,718,00016,793,600