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 23:34anboto1anboto1Score: 3,384Success
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 23:343,329509,399,596474,288,00025,071,00016,793,600
2Jul 29, 2026 23:343,351512,867,825477,123,00025,653,00016,793,600
3Jul 29, 2026 23:343,365514,717,844479,148,00025,701,00016,793,600
4Jul 29, 2026 23:343,380517,667,754481,148,00025,866,00016,793,600
5Jul 29, 2026 23:343,384517,637,693481,758,00025,852,00016,793,600
6Jul 29, 2026 23:343,396520,061,891484,434,00025,091,00016,793,600
7Jul 29, 2026 23:343,416522,555,524486,939,00025,531,00016,793,600
8Jul 29, 2026 23:343,427524,201,390489,093,00025,094,00016,793,600
9Jul 29, 2026 23:343,491533,730,291498,391,00025,352,00016,793,600