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:36Victor MerckléVictor MerckléScore: 1,663Success
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:371,660258,912,475241,468,0007,670,00016,797,696
2Jun 17, 2026 15:371,661258,887,613241,472,0007,722,00016,797,696
3Jun 17, 2026 15:371,661259,038,954241,475,0007,709,00016,797,696
4Jun 17, 2026 15:371,662259,053,189241,455,0007,899,00016,797,696
5Jun 17, 2026 15:371,663258,665,196241,771,0007,732,00016,797,696
6Jun 17, 2026 15:371,663259,259,667241,757,0007,735,00016,797,696
7Jun 17, 2026 15:371,666259,799,775242,237,0007,795,00016,797,696
8Jun 17, 2026 15:371,666259,324,280242,208,0007,718,00016,797,696
9Jun 17, 2026 15:371,667259,669,548242,400,0007,777,00016,797,696