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:00Aleksei ShahoikaAleksei ShahoikaScore: 2,131Success
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:012,105324,456,335310,112,0005,645,00016,797,696
2May 14, 2026 10:012,108326,025,171310,363,0005,948,00016,797,696
3May 14, 2026 10:012,108325,992,300310,596,0005,630,00016,797,696
4May 14, 2026 10:012,121327,924,444312,464,0005,766,00016,797,696
5May 14, 2026 10:012,131330,301,496314,134,0005,658,00016,797,696
6May 14, 2026 10:012,133328,901,301314,182,0005,909,00016,797,696
7May 14, 2026 10:012,141330,529,609315,221,0006,008,00016,797,696
8May 14, 2026 10:012,144333,629,301315,932,0005,788,00016,797,696
9May 14, 2026 10:012,152332,335,259317,029,0005,911,00016,797,696