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 17:22Tomislav 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 15, 2026 17:231,627254,214,498235,737,0008,376,00016,027,648stderr
2Aug 15, 2026 17:231,629254,546,858235,029,0009,415,00016,027,648stderr
3Aug 15, 2026 17:231,632255,576,781236,441,0008,376,00016,027,648stderr
4Aug 15, 2026 17:231,633256,205,648236,563,0008,437,00016,027,648stderr
5Aug 15, 2026 17:231,634256,297,933236,660,0008,445,00016,027,648stderr
6Aug 15, 2026 17:231,635256,125,916236,870,0008,516,00016,027,648stderr
7Aug 15, 2026 17:231,636256,467,484236,915,0008,518,00016,027,648stderr
8Aug 15, 2026 17:231,637256,278,642237,027,0008,530,00016,027,648stderr
9Aug 15, 2026 17:231,650270,119,247239,198,0008,415,00016,027,648stderr