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 listAug 13, 2026 13:43Tomislav TunkovicTomislav TunkovicScore: 1,836Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 13:461,833286,013,467264,432,00010,663,00016,801,792stderr
2Aug 13, 2026 13:461,835285,469,128264,777,00010,527,00016,801,792stderr
3Aug 13, 2026 13:461,835286,137,128264,689,00010,596,00016,801,792stderr
4Aug 13, 2026 13:461,836286,158,835264,818,00010,633,00016,801,792stderr
5Aug 13, 2026 13:461,836285,509,192264,905,00010,545,00016,801,792stderr
6Aug 13, 2026 13:461,837286,422,921265,063,00010,588,00016,801,792stderr
7Aug 13, 2026 13:461,839286,717,125265,249,00010,686,00016,801,792stderr
8Aug 13, 2026 13:461,839285,951,477265,325,00010,616,00016,801,792stderr
9Aug 13, 2026 13:461,840286,797,958265,406,00010,718,00016,801,792stderr