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:50Tomislav TunkovicTomislav TunkovicScore: 1,706Success
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:511,701265,263,890245,754,0009,439,00016,027,648stderr
2Aug 15, 2026 15:511,704265,670,987246,473,0009,177,00016,027,648stderr
3Aug 15, 2026 15:511,705265,823,475246,539,0009,245,00016,027,648stderr
4Aug 15, 2026 15:511,705266,564,457246,251,0009,559,00016,027,648stderr
5Aug 15, 2026 15:511,706266,609,203246,302,0009,643,00016,027,648stderr
6Aug 15, 2026 15:511,707266,891,246246,546,0009,587,00016,027,648stderr
7Aug 15, 2026 15:511,707266,140,169246,727,0009,415,00016,027,648stderr
8Aug 15, 2026 15:511,707266,775,355246,372,0009,683,00016,027,648stderr
9Aug 15, 2026 15:511,710267,239,028246,823,0009,736,00016,027,648stderr