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 21:23anboto1anboto1Score: 3,296Success
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 21:233,282502,309,297467,088,00025,354,00016,793,600
2Jul 29, 2026 21:233,287503,157,223467,521,00025,593,00016,793,600
3Jul 29, 2026 21:233,294504,049,139469,079,00025,141,00016,793,600
4Jul 29, 2026 21:233,296504,450,974469,318,00025,215,00016,793,600
5Jul 29, 2026 21:233,296504,564,969468,913,00025,634,00016,793,600
6Jul 29, 2026 21:233,299504,910,865469,178,00025,756,00016,793,600
7Jul 29, 2026 21:233,303505,436,134470,161,00025,345,00016,793,600
8Jul 29, 2026 21:233,311506,646,159471,308,00025,364,00016,793,600
9Jul 29, 2026 21:233,338510,794,134475,142,00025,625,00016,793,600