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 10:16Aleksei ShahoikaAleksei ShahoikaScore: 2,104Success
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 10:162,093325,680,058308,185,0005,768,00016,797,696
2May 14, 2026 10:162,097324,162,123308,723,0005,965,00016,797,696
3May 14, 2026 10:162,098323,906,696308,853,0005,870,00016,797,696
4May 14, 2026 10:162,100324,925,690309,221,0005,801,00016,797,696
5May 14, 2026 10:162,104324,512,605309,854,0005,864,00016,797,696
6May 14, 2026 10:162,110325,674,164310,829,0005,781,00016,797,696
7May 14, 2026 10:162,115327,806,576311,751,0005,645,00016,797,696
8May 14, 2026 10:162,117326,889,044311,858,0005,740,00016,797,696
9May 14, 2026 10:162,123327,311,904312,823,0005,685,00016,797,696