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:17Aleksei ShahoikaAleksei ShahoikaScore: 3,827Success
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:173,824582,858,395568,467,0005,251,00016,793,600
2May 13, 2026 22:173,825583,750,221568,455,0005,418,00016,793,600
3May 13, 2026 22:173,826585,055,403568,380,0005,645,00016,793,600
4May 13, 2026 22:173,826584,803,538568,588,0005,449,00016,793,600
5May 13, 2026 22:173,827584,581,229568,546,0005,521,00016,793,600
6May 13, 2026 22:173,827582,953,045568,403,0005,651,00016,793,600
7May 13, 2026 22:173,827583,995,878568,413,0005,719,00016,793,600
8May 13, 2026 22:173,828585,377,477568,698,0005,627,00016,793,600
9May 13, 2026 22:173,828584,801,340568,646,0005,628,00016,793,600