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 15, 2026 22:40izotoffizotoffScore: 3,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 22:443,901596,863,575575,770,0009,460,00016,818,176
2Oct 15, 2026 22:443,917600,965,597578,225,0009,333,00016,818,176
3Oct 15, 2026 22:443,925601,314,051578,474,00010,415,00016,818,176
4Oct 15, 2026 22:443,926600,613,880578,284,00010,622,00016,818,176
5Oct 15, 2026 22:443,950603,293,712582,003,00010,567,00016,818,176
6Oct 15, 2026 22:444,004612,692,844591,263,0009,349,00016,818,176
7Oct 15, 2026 22:444,011614,148,753591,304,00010,445,00016,818,176
8Oct 15, 2026 22:444,027616,266,019594,247,0009,951,00016,818,176
9Oct 15, 2026 22:444,029616,009,056594,987,0009,367,00016,818,176