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 listJul 29, 2026 18:46anboto1anboto1Score: 2,719Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2026 18:462,716417,488,934392,917,00014,580,00016,793,600
2Jul 29, 2026 18:462,717417,675,693393,059,00014,506,00016,793,600
3Jul 29, 2026 18:462,718417,892,743393,294,00014,519,00016,793,600
4Jul 29, 2026 18:462,719418,488,867393,404,00014,527,00016,793,600
5Jul 29, 2026 18:462,719417,807,154393,356,00014,527,00016,793,600
6Jul 29, 2026 18:462,724418,551,528394,021,00014,632,00016,793,600
7Jul 29, 2026 18:462,724418,612,291394,061,00014,657,00016,793,600
8Jul 29, 2026 18:462,725418,757,803394,244,00014,516,00016,793,600
9Jul 29, 2026 18:462,729419,432,348394,677,00014,693,00016,793,600