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:40anboto1anboto1Score: 3,768Success
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:403,735570,356,635536,406,00023,971,00016,793,600
2Jul 29, 2026 15:403,736570,390,111536,436,00024,019,00016,793,600
3Jul 29, 2026 15:403,739570,893,368536,900,00024,007,00016,793,600
4Jul 29, 2026 15:403,751572,784,771538,906,00023,879,00016,793,600
5Jul 29, 2026 15:403,768575,304,872540,965,00024,246,00016,793,600
6Jul 29, 2026 15:403,789578,465,846543,918,00024,482,00016,793,600
7Jul 29, 2026 15:403,789578,378,998544,417,00023,998,00016,793,600
8Jul 29, 2026 15:403,801580,317,385545,886,00024,362,00016,793,600
9Jul 29, 2026 15:403,889593,486,357559,263,00024,137,00016,793,600