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:46Tomislav TunkovicTomislav TunkovicScore: 1,838Success
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:471,835285,301,297264,711,00010,590,00016,801,792stderr
2Aug 13, 2026 13:471,835285,654,567264,783,00010,509,00016,801,792stderr
3Aug 13, 2026 13:471,836286,296,793264,731,00010,677,00016,801,792stderr
4Aug 13, 2026 13:471,837285,637,635265,018,00010,656,00016,801,792stderr
5Aug 13, 2026 13:471,838285,763,354265,181,00010,554,00016,801,792stderr
6Aug 13, 2026 13:471,838286,459,410265,034,00010,671,00016,801,792stderr
7Aug 13, 2026 13:471,839286,721,664265,272,00010,721,00016,801,792stderr
8Aug 13, 2026 13:471,840286,098,029265,553,00010,596,00016,801,792stderr
9Aug 13, 2026 13:471,841286,181,310265,568,00010,626,00016,801,792stderr