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 8, 2026 13:39Victor MerckléVictor MerckléScore: 1,713Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 13:401,712266,136,712249,270,0007,652,00016,797,696
2Jun 8, 2026 13:401,712266,123,979249,271,0007,647,00016,797,696
3Jun 8, 2026 13:401,712266,055,088249,335,0007,606,00016,797,696
4Jun 8, 2026 13:401,713266,243,171249,368,0007,730,00016,797,696
5Jun 8, 2026 13:401,713266,166,139249,307,0007,656,00016,797,696
6Jun 8, 2026 13:401,714266,361,902249,390,0007,824,00016,797,696
7Jun 8, 2026 13:401,718267,051,221250,021,0007,730,00016,797,696
8Jun 8, 2026 13:401,719267,021,408250,161,0007,706,00016,797,696
9Jun 8, 2026 13:401,719267,056,914250,192,0007,749,00016,797,696