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 16:26Victor 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 16:271,658257,940,957241,138,0007,665,00016,797,696
2Jun 17, 2026 16:271,659258,066,401241,246,0007,737,00016,797,696
3Jun 17, 2026 16:271,659258,472,825241,274,0007,703,00016,797,696
4Jun 17, 2026 16:271,659258,002,925241,256,0007,683,00016,797,696
5Jun 17, 2026 16:271,660258,190,085241,245,0007,802,00016,797,696
6Jun 17, 2026 16:271,661258,279,116241,342,0007,865,00016,797,696
7Jun 17, 2026 16:271,664258,728,949241,890,0007,759,00016,797,696
8Jun 17, 2026 16:271,665259,029,617242,008,0007,835,00016,797,696
9Jun 17, 2026 16:271,666259,145,256242,220,0007,777,00016,797,696