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 11:38Karthik ReddyKarthik ReddyScore: 1,560Success
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 11:591,558242,817,935229,596,0004,221,00016,793,600
2Oct 9, 2026 11:591,559242,855,484229,695,0004,232,00016,793,600
3Oct 9, 2026 11:591,559243,043,158229,754,0004,225,00016,793,600
4Oct 9, 2026 11:591,559242,977,467229,710,0004,264,00016,793,600
5Oct 9, 2026 11:591,560243,130,293229,903,0004,243,00016,793,600
6Oct 9, 2026 11:591,562243,251,270230,033,0004,281,00016,793,600
7Oct 9, 2026 11:591,562243,263,311230,105,0004,245,00016,793,600
8Oct 9, 2026 11:591,572244,945,996230,686,0005,138,00016,793,600
9Oct 9, 2026 11:591,573244,954,543231,731,0004,234,00016,793,600