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 7, 2026 12:53Victor MerckléVictor MerckléScore: 1,740Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 12:541,738269,988,184253,123,0007,624,00016,797,696
2Jun 7, 2026 12:541,739270,100,421253,243,0007,673,00016,797,696
3Jun 7, 2026 12:541,739270,173,343253,224,0007,750,00016,797,696
4Jun 7, 2026 12:541,740270,402,090253,390,0007,680,00016,797,696
5Jun 7, 2026 12:541,740270,231,842253,284,0007,722,00016,797,696
6Jun 7, 2026 12:541,741270,380,328253,404,0007,760,00016,797,696
7Jun 7, 2026 12:541,745270,988,022253,979,0007,827,00016,797,696
8Jun 7, 2026 12:541,746271,230,691254,252,0007,789,00016,797,696
9Jun 7, 2026 12:541,746271,082,268254,153,0007,786,00016,797,696