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 17, 2026 16:43Tomislav TunkovicTomislav TunkovicScore: 1,634Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 17:331,630252,843,734235,989,0008,557,00016,023,552
2Aug 17, 2026 17:331,630252,860,542236,262,0008,384,00016,023,552
3Aug 17, 2026 17:331,631253,064,722236,318,0008,475,00016,023,552
4Aug 17, 2026 17:331,631253,140,172236,406,0008,374,00016,023,552
5Aug 17, 2026 17:331,634253,449,863236,823,0008,340,00016,023,552
6Aug 17, 2026 17:331,635253,599,491236,894,0008,394,00016,023,552
7Aug 17, 2026 17:331,636253,788,239237,136,0008,365,00016,023,552
8Aug 17, 2026 17:331,636253,721,214236,886,0008,524,00016,023,552
9Aug 17, 2026 17:331,640255,713,637237,589,0008,482,00016,023,552