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 listJun 19, 2026 13:01Victor MerckléVictor MerckléScore: 1,651Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 13:021,651256,845,885239,866,0007,844,00016,797,696
2Jun 19, 2026 13:021,651256,812,254239,814,0007,874,00016,797,696
3Jun 19, 2026 13:021,651257,136,436239,857,0007,864,00016,797,696
4Jun 19, 2026 13:021,651256,758,291239,843,0007,859,00016,797,696
5Jun 19, 2026 13:021,651256,950,937239,927,0007,837,00016,797,696
6Jun 19, 2026 13:021,653257,194,648239,976,0008,020,00016,797,696
7Jun 19, 2026 13:021,656257,661,394240,674,0007,870,00016,797,696
8Jun 19, 2026 13:021,657257,779,072240,655,0007,939,00016,797,696
9Jun 19, 2026 13:021,658257,890,413240,827,0008,002,00016,797,696