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 listMay 16, 2026 23:23Aleksei ShahoikaAleksei ShahoikaScore: 1,982Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 23:241,978307,753,895291,161,0005,557,00016,797,696
2May 16, 2026 23:241,979305,784,936291,423,0005,453,00016,797,696
3May 16, 2026 23:241,982306,164,656292,111,0005,272,00016,797,696
4May 16, 2026 23:241,982307,580,862292,100,0005,342,00016,797,696
5May 16, 2026 23:241,982307,782,691291,828,0005,594,00016,797,696
6May 16, 2026 23:241,983306,371,986291,993,0005,476,00016,797,696
7May 16, 2026 23:241,985307,006,484291,957,0005,805,00016,797,696
8May 16, 2026 23:241,986307,272,073292,495,0005,447,00016,797,696
9May 16, 2026 23:241,987308,028,450292,671,0005,390,00016,797,696