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 17, 2026 04:11M-RochatM-RochatScore: 4,133Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 04:114,127630,403,444597,568,00021,544,00016,793,600
2May 17, 2026 04:114,130630,478,656597,980,00021,561,00016,793,600
3May 17, 2026 04:114,130630,560,608598,145,00021,451,00016,793,600
4May 17, 2026 04:114,131629,456,448598,176,00021,501,00016,793,600
5May 17, 2026 04:114,133630,656,259598,367,00021,600,00016,793,600
6May 17, 2026 04:114,133631,801,151598,550,00021,424,00016,793,600
7May 17, 2026 04:114,133628,919,917598,641,00021,435,00016,793,600
8May 17, 2026 04:114,134629,009,281598,749,00021,464,00016,793,600
9May 17, 2026 04:114,167634,082,130603,753,00021,304,00016,793,600