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:19Karthik ReddyKarthik ReddyScore: 1,567Success
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:291,559242,589,892229,655,0004,257,00016,793,600
2Oct 9, 2026 10:291,561242,897,003229,928,0004,240,00016,793,600
3Oct 9, 2026 10:291,561242,931,622229,908,0004,266,00016,793,600
4Oct 9, 2026 10:291,562243,153,103230,127,0004,249,00016,793,600
5Oct 9, 2026 10:291,567246,116,228230,947,0004,219,00016,793,600
6Oct 9, 2026 10:291,568244,097,550231,049,0004,256,00016,793,600
7Oct 9, 2026 10:291,572244,772,603231,684,0004,241,00016,793,600
8Oct 9, 2026 10:291,572244,582,789231,554,0004,253,00016,793,600
9Oct 9, 2026 10:291,573244,825,518231,865,0004,217,00016,793,600