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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 06:321,698264,061,120247,104,0007,741,00016,797,696
2Jun 12, 2026 06:321,699264,151,177247,177,0007,784,00016,797,696
3Jun 12, 2026 06:321,699264,176,653247,218,0007,774,00016,797,696
4Jun 12, 2026 06:321,699264,108,528247,148,0007,777,00016,797,696
5Jun 12, 2026 06:321,700264,213,340247,282,0007,797,00016,797,696
6Jun 12, 2026 06:321,700264,532,156247,359,0007,781,00016,797,696
7Jun 12, 2026 06:321,705264,986,765247,961,0007,818,00016,797,696
8Jun 12, 2026 06:321,707265,325,205248,259,0007,898,00016,797,696
9Jun 12, 2026 06:321,707265,305,244248,325,0007,849,00016,797,696