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 08:50Karthik 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 09:561,558242,445,571229,571,0004,226,00016,793,600
2Oct 9, 2026 09:561,558242,717,512228,780,0005,020,00016,793,600
3Oct 9, 2026 09:561,559242,656,608229,689,0004,215,00016,793,600
4Oct 9, 2026 09:561,560242,852,740229,796,0004,266,00016,793,600
5Oct 9, 2026 09:561,561242,974,838229,911,0004,275,00016,793,600
6Oct 9, 2026 09:561,562243,038,484230,063,0004,245,00016,793,600
7Oct 9, 2026 09:561,565243,579,502230,582,0004,297,00016,793,600
8Oct 9, 2026 09:561,571244,511,333231,408,0004,304,00016,793,600
9Oct 9, 2026 09:561,573244,688,531231,718,0004,232,00016,793,600