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 10:42Karthik ReddyKarthik ReddyScore: 1,565Success
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 10:591,559242,524,683229,639,0004,238,00016,793,600
2Oct 9, 2026 10:591,560242,880,674229,648,0004,419,00016,793,600
3Oct 9, 2026 10:591,561242,919,982229,969,0004,309,00016,793,600
4Oct 9, 2026 10:591,562243,045,188230,117,0004,228,00016,793,600
5Oct 9, 2026 10:591,565243,496,479230,511,0004,243,00016,793,600
6Oct 9, 2026 10:591,570244,299,876231,300,0004,236,00016,793,600
7Oct 9, 2026 10:591,571244,422,328231,353,0004,305,00016,793,600
8Oct 9, 2026 10:591,572244,591,161231,588,0004,221,00016,793,600
9Oct 9, 2026 10:591,573244,825,545231,787,0004,249,00016,793,600