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 18, 2026 02:25Victor MerckléVictor MerckléScore: 1,666Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 02:271,663258,750,675241,961,0007,634,00016,797,696
2Jun 18, 2026 02:271,664258,827,353242,021,0007,690,00016,797,696
3Jun 18, 2026 02:271,664258,861,876242,022,0007,673,00016,797,696
4Jun 18, 2026 02:271,664258,783,494241,953,0007,687,00016,797,696
5Jun 18, 2026 02:271,666259,120,865242,240,0007,690,00016,797,696
6Jun 18, 2026 02:271,667259,326,071242,314,0007,751,00016,797,696
7Jun 18, 2026 02:271,670259,822,700242,863,0007,770,00016,797,696
8Jun 18, 2026 02:271,670259,606,552242,768,0007,747,00016,797,696
9Jun 18, 2026 02:271,670259,591,980242,790,0007,714,00016,797,696