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 13, 2026 13:48Tomislav TunkovicTomislav TunkovicScore: 1,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 13:491,826282,437,684263,754,00010,281,00016,801,792stderr
2Aug 13, 2026 13:491,827282,654,925263,812,00010,342,00016,801,792stderr
3Aug 13, 2026 13:491,830283,005,343264,221,00010,389,00016,801,792stderr
4Aug 13, 2026 13:491,830282,991,855264,312,00010,271,00016,801,792stderr
5Aug 13, 2026 13:491,830282,751,988264,270,00010,262,00016,801,792stderr
6Aug 13, 2026 13:491,831283,817,476264,319,00010,386,00016,801,792stderr
7Aug 13, 2026 13:491,833283,252,890264,540,00010,466,00016,801,792stderr
8Aug 13, 2026 13:491,834283,730,204264,770,00010,445,00016,801,792stderr
9Aug 13, 2026 13:491,834283,384,220264,801,00010,404,00016,801,792stderr