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 11, 2026 08:54Tomislav TunkovicTomislav TunkovicScore: 2,037Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 08:542,034315,215,654288,996,00016,221,00016,801,792stderr
2Aug 11, 2026 08:542,034315,167,873289,004,00016,116,00016,805,888stderr
3Aug 11, 2026 08:542,035316,094,766289,133,00016,238,00016,801,792stderr
4Aug 11, 2026 08:542,036315,439,261289,145,00016,307,00016,801,792stderr
5Aug 11, 2026 08:542,037315,637,230289,460,00016,144,00016,801,792stderr
6Aug 11, 2026 08:542,037315,682,452289,491,00016,118,00016,801,792stderr
7Aug 11, 2026 08:542,037315,607,796289,281,00016,297,00016,801,792stderr
8Aug 11, 2026 08:542,038315,889,963289,648,00016,156,00016,801,792stderr
9Aug 11, 2026 08:542,038315,796,290289,606,00016,166,00016,801,792stderr