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 11, 2026 07:09Tomislav TunkovicTomislav TunkovicScore: 3,123Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 07:093,119478,079,072455,142,00012,784,00016,801,792stderr
2Aug 11, 2026 07:093,120478,245,042455,244,00012,897,00016,801,792stderr
3Aug 11, 2026 07:093,120478,336,787455,238,00012,815,00016,801,792stderr
4Aug 11, 2026 07:093,120478,887,182455,200,00012,880,00016,801,792stderr
5Aug 11, 2026 07:093,123479,265,839455,542,00012,975,00016,801,792stderr
6Aug 11, 2026 07:093,124478,613,379455,737,00012,897,00016,801,792stderr
7Aug 11, 2026 07:093,125479,061,433455,855,00012,969,00016,801,792stderr
8Aug 11, 2026 07:093,130479,650,878456,505,00013,037,00016,801,792stderr
9Aug 11, 2026 07:093,181498,487,627463,848,00013,335,00016,801,792stderr