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 21:26Aleksei ShahoikaAleksei ShahoikaScore: 4,275Success
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 21:264,262651,082,067634,578,0004,803,00016,793,600
2May 13, 2026 21:264,271649,464,951635,820,0004,888,00016,793,600
3May 13, 2026 21:264,272651,698,012635,953,0004,849,00016,793,600
4May 13, 2026 21:264,273650,474,765636,203,0004,846,00016,793,600
5May 13, 2026 21:264,275653,723,885636,505,0004,872,00016,793,600
6May 13, 2026 21:264,291654,564,456638,850,0004,894,00016,793,600
7May 13, 2026 21:264,294653,625,050636,391,0007,786,00016,793,600
8May 13, 2026 21:264,297654,336,855639,796,0004,884,00016,793,600
9May 13, 2026 21:264,363663,188,664649,591,0004,879,00016,793,600