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:14anboto1anboto1Score: 3,272Success
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:143,175486,380,165451,288,00025,062,00016,793,600
2Jul 29, 2026 21:143,175486,207,049451,367,00024,914,00016,793,600
3Jul 29, 2026 21:143,180487,020,941452,051,00025,040,00016,793,600
4Jul 29, 2026 21:143,244496,649,897461,934,00024,782,00016,793,600
5Jul 29, 2026 21:143,272500,873,922465,463,00025,357,00016,793,600
6Jul 29, 2026 21:143,277501,411,388467,009,00024,547,00016,793,600
7Jul 29, 2026 21:143,288504,436,563468,462,00024,849,00016,793,600
8Jul 29, 2026 21:143,309506,485,770471,314,00025,117,00016,793,600
9Jul 29, 2026 21:143,380516,972,752481,946,00025,097,00016,793,600