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 20, 2026 17:07M-RochatM-RochatScore: 4,235Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 17:074,231644,065,544613,535,00021,204,00016,793,600
2May 20, 2026 17:074,233646,109,768613,743,00021,213,00016,793,600
3May 20, 2026 17:074,234645,730,114614,283,00020,884,00016,793,600
4May 20, 2026 17:074,234645,446,382613,878,00021,263,00016,793,600
5May 20, 2026 17:074,235644,968,034614,053,00021,221,00016,793,600
6May 20, 2026 17:074,237646,675,701614,527,00021,111,00016,793,600
7May 20, 2026 17:074,237646,565,892614,408,00021,169,00016,793,600
8May 20, 2026 17:074,243647,385,396615,257,00021,210,00016,793,600
9May 20, 2026 17:074,268650,094,469619,032,00021,227,00016,793,600