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 17, 2026 15:56Victor MerckléVictor MerckléScore: 1,660Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 15:571,658257,792,306241,122,0007,599,00016,797,696
2Jun 17, 2026 15:571,659258,025,317241,174,0007,751,00016,797,696
3Jun 17, 2026 15:571,660258,654,369241,360,0007,771,00016,797,696
4Jun 17, 2026 15:571,660258,071,201241,352,0007,729,00016,797,696
5Jun 17, 2026 15:571,660258,566,833241,299,0007,749,00016,797,696
6Jun 17, 2026 15:571,661258,299,592241,365,0007,821,00016,797,696
7Jun 17, 2026 15:571,665258,965,811241,985,0007,806,00016,797,696
8Jun 17, 2026 15:571,665258,834,824241,958,0007,816,00016,797,696
9Jun 17, 2026 15:571,666259,127,044242,063,0007,908,00016,797,696