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 21:34anboto1anboto1Score: 3,094Success
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 21:343,084472,585,362437,554,00025,116,00016,793,600
2Jul 29, 2026 21:343,090475,476,277438,274,00025,230,00016,793,600
3Jul 29, 2026 21:343,091473,702,278438,434,00025,289,00016,793,600
4Jul 29, 2026 21:343,093474,026,166438,712,00025,319,00016,793,600
5Jul 29, 2026 21:343,094474,332,170438,904,00025,318,00016,793,600
6Jul 29, 2026 21:343,095474,267,703438,982,00025,307,00016,793,600
7Jul 29, 2026 21:343,104475,660,262440,326,00025,351,00016,793,600
8Jul 29, 2026 21:343,106475,984,391440,387,00025,560,00016,793,600
9Jul 29, 2026 21:343,112476,966,164441,406,00025,519,00016,793,600