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 18:40anboto1anboto1Score: 2,893Success
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 18:412,887443,183,454424,511,0008,643,00016,793,600
2Jul 29, 2026 18:412,890443,664,035424,904,0008,635,00016,793,600
3Jul 29, 2026 18:412,891443,656,215425,101,0008,667,00016,793,600
4Jul 29, 2026 18:412,891443,772,380424,868,0008,891,00016,793,600
5Jul 29, 2026 18:412,893444,025,341425,305,0008,707,00016,793,600
6Jul 29, 2026 18:412,894444,018,055425,340,0008,764,00016,793,600
7Jul 29, 2026 18:412,895444,178,788425,559,0008,725,00016,793,600
8Jul 29, 2026 18:412,897444,649,024425,939,0008,679,00016,793,600
9Jul 29, 2026 18:412,900444,998,369426,363,0008,729,00016,793,600