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:29Tomislav TunkovicTomislav TunkovicScore: 1,647Success
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:301,646255,570,088238,730,0008,265,00016,027,648stderr
2Aug 15, 2026 16:301,646255,344,741238,431,0008,552,00016,027,648stderr
3Aug 15, 2026 16:301,646255,240,968238,437,0008,480,00016,027,648stderr
4Aug 15, 2026 16:301,646255,212,930238,617,0008,431,00016,027,648stderr
5Aug 15, 2026 16:301,647255,296,127238,790,0008,287,00016,027,648stderr
6Aug 15, 2026 16:301,648255,699,472238,045,0009,240,00016,027,648stderr
7Aug 15, 2026 16:301,649255,714,578239,121,0008,312,00016,027,648stderr
8Aug 15, 2026 16:301,650255,820,164239,233,0008,382,00016,027,648stderr
9Aug 15, 2026 16:301,654256,536,887239,759,0008,484,00016,027,648stderr