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 15:42Tomislav TunkovicTomislav TunkovicScore: 1,696Success
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 15:431,695264,318,416245,921,0008,378,00016,027,648stderr
2Aug 15, 2026 15:431,695264,346,712245,905,0008,360,00016,027,648stderr
3Aug 15, 2026 15:431,695264,327,519245,013,0009,240,00016,027,648stderr
4Aug 15, 2026 15:431,696264,453,648245,053,0009,366,00016,027,648stderr
5Aug 15, 2026 15:431,696264,639,496245,172,0009,375,00016,027,648stderr
6Aug 15, 2026 15:431,696264,505,279245,169,0009,317,00016,027,648stderr
7Aug 15, 2026 15:431,698264,800,140246,323,0008,439,00016,027,648stderr
8Aug 15, 2026 15:431,698264,995,943245,415,0009,345,00016,027,648stderr
9Aug 15, 2026 15:431,699265,572,810246,301,0008,551,00016,027,648stderr