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:10Victor MerckléVictor MerckléScore: 1,661Success
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:111,660260,008,311241,310,0007,799,00016,797,696
2Jun 17, 2026 15:111,660258,191,878241,462,0007,625,00016,797,696
3Jun 17, 2026 15:111,661258,286,849241,355,0007,811,00016,797,696
4Jun 17, 2026 15:111,661258,256,183241,356,0007,820,00016,797,696
5Jun 17, 2026 15:111,661258,400,591241,445,0007,727,00016,797,696
6Jun 17, 2026 15:111,662258,657,620241,688,0007,726,00016,797,696
7Jun 17, 2026 15:111,664258,937,015241,957,0007,775,00016,797,696
8Jun 17, 2026 15:111,665258,918,748241,961,0007,851,00016,797,696
9Jun 17, 2026 15:111,666259,239,198242,200,0007,823,00016,797,696