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 listMay 14, 2026 00:12Aleksei ShahoikaAleksei ShahoikaScore: 2,370Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 00:122,309355,187,172340,678,0005,698,00016,797,696
2May 14, 2026 00:122,317356,312,707341,679,0005,901,00016,797,696
3May 14, 2026 00:122,333358,783,770344,360,0005,688,00016,797,696
4May 14, 2026 00:122,346362,400,644346,282,0005,650,00016,797,696
5May 14, 2026 00:122,370366,198,760349,670,0005,949,00016,797,696
6May 14, 2026 00:122,375366,317,703350,718,0005,674,00016,797,696
7May 14, 2026 00:122,376367,215,519350,296,0006,122,00016,797,696
8May 14, 2026 00:122,380365,757,904351,307,0005,699,00016,797,696
9May 14, 2026 00:122,394368,005,387353,383,0005,745,00016,797,696