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 23, 2026 16:20Kasper KivimäkiKasper KivimäkiScore: 5,618Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 16:215,615852,189,264814,006,00028,360,00016,793,600
2Jul 23, 2026 16:215,615852,101,372814,720,00027,569,00016,793,600
3Jul 23, 2026 16:215,617852,454,957815,171,00027,507,00016,793,600
4Jul 23, 2026 16:215,618852,692,786814,816,00027,983,00016,793,600
5Jul 23, 2026 16:215,618852,645,766814,736,00028,044,00016,793,600
6Jul 23, 2026 16:215,620853,490,992815,444,00027,660,00016,793,600
7Jul 23, 2026 16:215,631854,722,473816,930,00027,849,00016,793,600
8Jul 23, 2026 16:215,633854,913,613816,680,00028,369,00016,793,600
9Jul 23, 2026 16:215,636855,326,217818,074,00027,345,00016,793,600