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:07Tomislav TunkovicTomislav TunkovicScore: 1,681Success
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:071,675261,315,760241,784,0009,547,00016,027,648stderr
2Aug 15, 2026 16:071,679262,592,376243,421,0008,492,00016,027,648stderr
3Aug 15, 2026 16:071,679261,953,100242,764,0009,234,00016,027,648stderr
4Aug 15, 2026 16:071,680262,439,437243,623,0008,521,00016,027,648stderr
5Aug 15, 2026 16:071,681262,983,711243,722,0008,505,00016,027,648stderr
6Aug 15, 2026 16:071,681262,888,898243,687,0008,476,00016,027,648stderr
7Aug 15, 2026 16:071,682263,060,128243,821,0008,515,00016,027,648stderr
8Aug 15, 2026 16:071,682263,069,434243,745,0008,582,00016,027,648stderr
9Aug 15, 2026 16:071,684263,439,502243,119,0009,516,00016,027,648stderr