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 13, 2026 23:06Aleksei ShahoikaAleksei ShahoikaScore: 3,150Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 23:073,141482,059,516465,135,0006,067,00016,797,696
2May 13, 2026 23:073,141482,096,488465,390,0005,797,00016,797,696
3May 13, 2026 23:073,145480,777,116466,043,0005,787,00016,797,696
4May 13, 2026 23:073,147480,919,528466,426,0005,762,00016,797,696
5May 13, 2026 23:073,150481,272,697466,890,0005,649,00016,797,696
6May 13, 2026 23:073,152482,545,882466,933,0005,898,00016,797,696
7May 13, 2026 23:073,157483,304,206468,016,0005,640,00016,797,696
8May 13, 2026 23:073,165483,531,883469,034,0005,782,00016,797,696
9May 13, 2026 23:073,166483,788,034469,139,0005,845,00016,797,696