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 17:39M-RochatM-RochatScore: 4,165Success
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 17:394,150631,944,614601,341,00021,293,00016,793,600
2May 22, 2026 17:394,153632,910,040601,824,00021,201,00016,793,600
3May 22, 2026 17:394,156634,834,183602,286,00021,222,00016,793,600
4May 22, 2026 17:394,164636,557,391603,269,00021,343,00016,793,600
5May 22, 2026 17:394,165635,929,780603,218,00021,572,00016,793,600
6May 22, 2026 17:394,167635,984,843603,641,00021,497,00016,793,600
7May 22, 2026 17:394,191639,663,195608,026,00020,671,00016,793,600
8May 22, 2026 17:394,193640,523,302608,382,00020,708,00016,793,600
9May 22, 2026 17:394,204640,308,152609,744,00020,901,00016,793,600