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 listJun 24, 2026 12:34anboto1anboto1Score: 3,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 12:343,114476,396,739442,490,00024,735,00016,793,600
2Jun 24, 2026 12:343,123477,720,266444,128,00024,348,00016,793,600
3Jun 24, 2026 12:343,135479,455,172444,306,00025,972,00016,793,600
4Jun 24, 2026 12:343,135479,578,883444,419,00025,974,00016,793,600
5Jun 24, 2026 12:343,138479,946,883444,500,00026,236,00016,793,600
6Jun 24, 2026 12:343,142480,552,817446,072,00025,376,00016,793,600
7Jun 24, 2026 12:343,142480,431,719445,519,00025,804,00016,793,600
8Jun 24, 2026 12:343,144480,784,781446,002,00025,724,00016,793,600
9Jun 24, 2026 12:343,186487,122,683453,464,00024,482,00016,793,600