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:23Kasper KivimäkiKasper KivimäkiScore: 5,300Success
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:245,298804,550,524767,622,00027,097,00016,793,600
2Jul 23, 2026 16:245,299804,837,339767,286,00027,650,00016,793,600
3Jul 23, 2026 16:245,300804,887,365767,352,00027,754,00016,793,600
4Jul 23, 2026 16:245,300804,869,609767,978,00027,156,00016,793,600
5Jul 23, 2026 16:245,300804,873,430767,430,00027,666,00016,793,600
6Jul 23, 2026 16:245,302805,125,848768,124,00027,200,00016,793,600
7Jul 23, 2026 16:245,304805,563,043768,168,00027,538,00016,793,600
8Jul 23, 2026 16:245,305805,684,765768,428,00027,391,00016,793,600
9Jul 23, 2026 16:245,306805,944,560767,517,00028,439,00016,793,600