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 7, 2026 20:09Karthik ReddyKarthik ReddyScore: 1,584Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2026 20:091,575245,379,275232,137,0004,208,00016,793,600
2Oct 7, 2026 20:091,575247,543,481232,156,0004,205,00016,793,600
3Oct 7, 2026 20:091,576245,593,370232,250,0004,241,00016,793,600
4Oct 7, 2026 20:091,577245,718,248232,398,0004,237,00016,793,600
5Oct 7, 2026 20:091,584246,692,596233,423,0004,204,00016,793,600
6Oct 7, 2026 20:091,592247,967,433234,684,0004,259,00016,793,600
7Oct 7, 2026 20:091,593248,340,589234,837,0004,251,00016,793,600
8Oct 7, 2026 20:091,593248,125,125234,711,0004,283,00016,793,600
9Oct 7, 2026 20:091,611250,763,760237,415,0004,253,00016,793,600