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:28anboto1anboto1Score: 2,517Success
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:292,514387,486,320362,304,00014,916,00016,793,600
2Jul 29, 2026 18:292,515387,633,334362,396,00014,993,00016,793,600
3Jul 29, 2026 18:292,515387,477,830362,356,00014,916,00016,793,600
4Jul 29, 2026 18:292,517388,552,286362,535,00015,070,00016,793,600
5Jul 29, 2026 18:292,517388,498,676362,571,00015,022,00016,793,600
6Jul 29, 2026 18:292,517388,550,569362,650,00014,975,00016,793,600
7Jul 29, 2026 18:292,519388,097,351362,991,00014,918,00016,793,600
8Jul 29, 2026 18:292,525389,123,896363,777,00014,982,00016,793,600
9Jul 29, 2026 18:292,526389,297,657363,855,00015,192,00016,793,600