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 22:14anboto1anboto1Score: 3,109Success
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 22:143,080472,086,095436,721,00025,400,00016,793,600
2Jul 29, 2026 22:143,082472,360,224437,372,00025,039,00016,793,600
3Jul 29, 2026 22:143,087472,991,134437,362,00025,701,00016,793,600
4Jul 29, 2026 22:143,095474,420,068438,933,00025,357,00016,793,600
5Jul 29, 2026 22:143,109476,388,236441,138,00025,310,00016,793,600
6Jul 29, 2026 22:143,112476,857,791441,579,00025,249,00016,793,600
7Jul 29, 2026 22:143,116477,419,922441,795,00025,711,00016,793,600
8Jul 29, 2026 22:143,121478,505,999442,991,00025,246,00016,793,600
9Jul 29, 2026 22:143,136480,560,275444,981,00025,470,00016,793,600