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 19, 2026 16:56Victor MerckléVictor MerckléScore: 1,796Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 17:121,794279,186,263261,281,0007,951,00016,801,792stderr
2Aug 19, 2026 17:121,795279,179,708261,433,0007,850,00016,801,792stderr
3Aug 19, 2026 17:121,796279,995,840261,493,0007,950,00016,801,792stderr
4Aug 19, 2026 17:121,796279,325,559261,591,0007,882,00016,801,792stderr
5Aug 19, 2026 17:121,796279,246,599261,469,0007,932,00016,801,792stderr
6Aug 19, 2026 17:121,799279,747,442261,985,0007,897,00016,801,792stderr
7Aug 19, 2026 17:121,800279,988,837262,086,0007,981,00016,801,792stderr
8Aug 19, 2026 17:121,800280,021,116262,110,0008,025,00016,801,792stderr
9Aug 19, 2026 17:121,802280,340,165261,689,0008,642,00016,801,792stderr