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:17Tomislav TunkovicTomislav TunkovicScore: 1,661Success
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:181,657258,647,934239,330,0009,234,00016,027,648stderr
2Aug 15, 2026 16:181,658258,814,880239,336,0009,418,00016,027,648stderr
3Aug 15, 2026 16:181,660259,183,933239,675,0009,469,00016,027,648stderr
4Aug 15, 2026 16:181,661259,843,431239,629,0009,545,00016,027,648stderr
5Aug 15, 2026 16:181,661259,925,144239,866,0009,320,00016,027,648stderr
6Aug 15, 2026 16:181,662259,312,238240,029,0009,325,00016,027,648stderr
7Aug 15, 2026 16:181,662260,146,551240,006,0009,401,00016,027,648stderr
8Aug 15, 2026 16:181,665260,547,048240,407,0009,429,00016,027,648stderr
9Aug 15, 2026 16:181,666259,985,853240,437,0009,509,00016,027,648stderr