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:57anboto1anboto1Score: 3,347Success
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:583,336511,835,736459,932,00040,581,00016,793,600
2Jul 29, 2026 15:583,343511,526,014459,467,00042,032,00016,793,600
3Jul 29, 2026 15:583,343511,671,836461,135,00040,445,00016,793,600
4Jul 29, 2026 15:583,343511,540,350461,014,00040,569,00016,793,600
5Jul 29, 2026 15:583,347512,048,575461,448,00040,666,00016,793,600
6Jul 29, 2026 15:583,351512,724,852461,308,00041,388,00016,793,600
7Jul 29, 2026 15:583,352512,779,428462,494,00040,333,00016,793,600
8Jul 29, 2026 15:583,354513,179,211462,692,00040,498,00016,793,600
9Jul 29, 2026 15:583,407521,206,420469,451,00041,649,00016,793,600