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 listSep 21, 2026 17:42Andrew EpsteinAndrew EpsteinScore: 1,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 21, 2026 17:441,605250,377,323236,476,0004,304,00016,793,600
2Sep 21, 2026 17:441,606251,446,453236,761,0004,274,00016,793,600
3Sep 21, 2026 17:441,607251,995,247236,964,0004,140,00016,793,600
4Sep 21, 2026 17:441,607251,276,198236,738,0004,325,00016,793,600
5Sep 21, 2026 17:441,608251,872,153237,095,0004,119,00016,793,600
6Sep 21, 2026 17:441,608250,289,086236,930,0004,325,00016,793,600
7Sep 21, 2026 17:441,608249,933,047236,912,0004,305,00016,793,600
8Sep 21, 2026 17:441,608251,393,517237,181,0004,162,00016,793,600
9Sep 21, 2026 17:441,612252,231,274237,634,0004,168,00016,793,600