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 20:29anboto1anboto1Score: 4,416Success
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 20:304,337660,601,428625,882,00024,738,00016,793,600
2Jul 29, 2026 20:304,364664,710,035630,091,00024,581,00016,793,600
3Jul 29, 2026 20:304,371665,907,553631,161,00024,634,00016,793,600
4Jul 29, 2026 20:304,392668,905,202634,337,00024,519,00016,793,600
5Jul 29, 2026 20:304,416672,491,031636,729,00025,696,00016,793,600
6Jul 29, 2026 20:304,437675,492,627640,811,00024,772,00016,793,600
7Jul 29, 2026 20:304,438675,751,611639,810,00025,911,00016,793,600
8Jul 29, 2026 20:304,458679,424,048644,271,00024,577,00016,793,600
9Jul 29, 2026 20:304,529689,375,589653,786,00025,707,00016,793,600