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 listApr 26, 2026 15:48Victor MerckléVictor MerckléScore: 1,848Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 15:491,841291,280,725269,209,0007,005,00017,145,856
2Apr 26, 2026 15:491,845305,244,260270,788,0005,995,00017,141,760
3Apr 26, 2026 15:491,847296,292,874271,179,0006,003,00017,149,952
4Apr 26, 2026 15:491,847289,035,715270,101,0007,002,00017,145,856
5Apr 26, 2026 15:491,848296,758,581270,280,0007,007,00017,158,144
6Apr 26, 2026 15:491,848297,634,576270,330,0006,982,00017,145,856
7Apr 26, 2026 15:491,850296,596,726271,524,0005,989,00017,141,760
8Apr 26, 2026 15:491,853299,695,416272,009,0006,000,00017,145,856
9Apr 26, 2026 15:491,854293,105,670272,217,0006,004,00017,235,968