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 22, 2026 23:12M-RochatM-RochatScore: 4,137Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 23:124,117630,484,401590,258,00027,390,00016,793,600
2May 22, 2026 23:124,126629,167,270591,256,00027,758,00016,793,600
3May 22, 2026 23:124,129628,901,978590,777,00028,649,00016,793,600
4May 22, 2026 23:124,137629,944,803592,554,00028,124,00016,793,600
5May 22, 2026 23:124,137631,469,059592,505,00028,063,00016,793,600
6May 22, 2026 23:124,138630,792,096592,408,00028,299,00016,793,600
7May 22, 2026 23:124,146632,953,450593,426,00028,518,00016,793,600
8May 22, 2026 23:124,147632,993,795593,696,00028,399,00016,793,600
9May 22, 2026 23:124,150632,198,238594,385,00028,260,00016,793,600