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:48Tomislav 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:491,691263,753,885245,421,0008,347,00016,027,648stderr
2Aug 15, 2026 15:491,691263,784,679245,403,0008,275,00016,027,648stderr
3Aug 15, 2026 15:491,691263,815,125245,219,0008,532,00016,027,648stderr
4Aug 15, 2026 15:491,692263,856,334244,617,0009,257,00016,027,648stderr
5Aug 15, 2026 15:491,696265,254,983246,012,0008,517,00016,027,648stderr
6Aug 15, 2026 15:491,696265,251,965245,897,0008,528,00016,027,648stderr
7Aug 15, 2026 15:491,696264,759,591246,003,0008,443,00016,027,648stderr
8Aug 15, 2026 15:491,696265,268,431245,941,0008,536,00016,027,648stderr
9Aug 15, 2026 15:491,697265,281,694246,185,0008,378,00016,027,648stderr