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:51Tomislav TunkovicTomislav TunkovicScore: 1,831Success
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:521,827282,515,264263,802,00010,284,00016,801,792stderr
2Aug 13, 2026 13:521,828282,452,340263,873,00010,418,00016,801,792stderr
3Aug 13, 2026 13:521,829284,057,811264,023,00010,359,00016,801,792stderr
4Aug 13, 2026 13:521,830283,033,513264,291,00010,292,00016,801,792stderr
5Aug 13, 2026 13:521,831282,844,358264,338,00010,333,00016,801,792stderr
6Aug 13, 2026 13:521,832282,969,648264,417,00010,383,00016,801,792stderr
7Aug 13, 2026 13:521,833283,140,314264,653,00010,348,00016,801,792stderr
8Aug 13, 2026 13:521,833283,196,660264,616,00010,391,00016,801,792stderr
9Aug 13, 2026 13:521,834283,463,662264,807,00010,429,00016,801,792stderr