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 22, 2026 23:13M-RochatM-RochatScore: 4,140Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 23:134,126629,824,163591,108,00027,844,00016,793,600
2May 22, 2026 23:134,129629,193,728591,254,00028,213,00016,793,600
3May 22, 2026 23:134,139633,165,511592,389,00028,572,00016,793,600
4May 22, 2026 23:134,139633,155,817592,617,00028,291,00016,793,600
5May 22, 2026 23:134,140633,520,678592,498,00028,556,00016,793,600
6May 22, 2026 23:134,141632,183,133592,818,00028,434,00016,793,600
7May 22, 2026 23:134,144631,782,647593,468,00028,245,00016,793,600
8May 22, 2026 23:134,148633,001,973593,560,00028,647,00016,793,600
9May 22, 2026 23:134,152635,093,250594,222,00028,642,00016,793,600