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 15:42anboto1anboto1Score: 2,919Success
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 15:422,917446,728,203430,834,0006,851,00016,797,696
2Jul 29, 2026 15:422,918446,422,877431,008,0006,796,00016,797,696
3Jul 29, 2026 15:422,918446,201,550430,902,0006,838,00016,797,696
4Jul 29, 2026 15:422,918446,435,807431,050,0006,741,00016,797,696
5Jul 29, 2026 15:422,919446,458,189430,930,0007,007,00016,797,696
6Jul 29, 2026 15:422,922446,890,010431,566,0006,870,00016,797,696
7Jul 29, 2026 15:422,922447,633,661431,510,0006,827,00016,797,696
8Jul 29, 2026 15:422,924446,991,832431,719,0006,891,00016,797,696
9Jul 29, 2026 15:422,969461,908,754438,870,0006,569,00016,797,696