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:02M-RochatM-RochatScore: 4,230Success
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:024,225645,126,616612,692,00021,139,00016,793,600
2May 22, 2026 23:024,226644,896,525612,800,00021,227,00016,793,600
3May 22, 2026 23:024,229644,446,632612,989,00021,432,00016,793,600
4May 22, 2026 23:024,230646,850,389613,153,00021,436,00016,793,600
5May 22, 2026 23:024,230645,510,299613,513,00021,061,00016,793,600
6May 22, 2026 23:024,230646,845,858613,461,00021,101,00016,793,600
7May 22, 2026 23:024,231644,545,432613,562,00021,109,00016,793,600
8May 22, 2026 23:024,233646,259,382613,531,00021,455,00016,793,600
9May 22, 2026 23:024,236646,302,345614,070,00021,391,00016,793,600