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 13, 2026 23:29Aleksei ShahoikaAleksei ShahoikaScore: 3,150Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 23:293,122477,158,083462,486,0005,828,00016,797,696
2May 13, 2026 23:293,145481,829,718466,136,0005,675,00016,797,696
3May 13, 2026 23:293,149481,214,988466,429,0006,014,00016,797,696
4May 13, 2026 23:293,150481,345,065466,856,0005,649,00016,797,696
5May 13, 2026 23:293,150482,338,387466,275,0006,252,00016,797,696
6May 13, 2026 23:293,156482,292,103467,657,0005,854,00016,797,696
7May 13, 2026 23:293,160484,576,475468,215,0005,828,00016,797,696
8May 13, 2026 23:293,160482,794,568468,289,0005,812,00016,797,696
9May 13, 2026 23:293,165485,995,770468,960,0005,805,00016,797,696