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:00M-RochatM-RochatScore: 4,126Success
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:014,124629,583,802597,329,00021,277,00016,793,600
2May 20, 2026 17:014,124628,444,972597,427,00021,180,00016,793,600
3May 20, 2026 17:014,125630,282,223597,521,00021,283,00016,793,600
4May 20, 2026 17:014,125631,040,643597,534,00021,362,00016,793,600
5May 20, 2026 17:014,126628,907,372597,800,00021,226,00016,793,600
6May 20, 2026 17:014,129629,245,215598,246,00021,239,00016,793,600
7May 20, 2026 17:014,129629,686,426598,119,00021,320,00016,793,600
8May 20, 2026 17:014,132632,187,967598,545,00021,295,00016,793,600
9May 20, 2026 17:014,180636,899,394604,886,00022,227,00016,793,600