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 listJan 5, 2026 03:56Josu San MartinJosu San MartinScore: 3,316Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 03:543,310520,889,074458,524,00037,960,00016,961,536
2Jan 5, 2026 03:543,311528,094,448463,676,00032,976,00017,068,032
3Jan 5, 2026 03:563,315526,205,500456,337,00040,940,00017,084,416
4Jan 5, 2026 03:543,316523,760,888461,396,00035,952,00017,068,032
5Jan 5, 2026 03:563,316521,894,729460,388,00036,950,00016,957,440
6Jan 5, 2026 03:563,337533,570,618459,544,00040,959,00017,154,048