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 22:47Aleksei ShahoikaAleksei ShahoikaScore: 3,183Success
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 22:473,174486,051,272470,117,0006,078,00016,797,696
2May 13, 2026 22:473,176485,422,281470,651,0005,756,00016,797,696
3May 13, 2026 22:473,177485,316,532470,733,0005,826,00016,797,696
4May 13, 2026 22:473,180487,312,300471,066,0006,012,00016,797,696
5May 13, 2026 22:473,183486,425,405471,532,0005,988,00016,797,696
6May 13, 2026 22:473,187486,930,248472,370,0005,771,00016,797,696
7May 13, 2026 22:473,189487,445,021472,764,0005,676,00016,797,696
8May 13, 2026 22:473,195488,293,009473,527,0005,783,00016,797,696
9May 13, 2026 22:473,196489,038,848473,637,0005,813,00016,797,696