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 15, 2026 16:25Tomislav TunkovicTomislav TunkovicScore: 1,645Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 16:261,642257,137,003237,078,0009,320,00016,027,648stderr
2Aug 15, 2026 16:261,643256,550,274237,163,0009,315,00016,027,648stderr
3Aug 15, 2026 16:261,643256,596,777237,230,0009,358,00016,027,648stderr
4Aug 15, 2026 16:261,644256,917,312237,469,0009,175,00016,027,648stderr
5Aug 15, 2026 16:261,645256,815,202237,402,0009,408,00016,027,648stderr
6Aug 15, 2026 16:261,647258,092,325237,612,0009,457,00016,027,648stderr
7Aug 15, 2026 16:261,648257,994,316238,774,0008,472,00016,027,648stderr
8Aug 15, 2026 16:261,651257,766,657239,197,0008,540,00016,027,648stderr
9Aug 15, 2026 16:261,653258,691,060239,422,0008,550,00016,027,648stderr