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:26Victor 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:271,698263,988,111247,059,0007,776,00016,797,696
2Jun 12, 2026 06:271,698263,913,606246,999,0007,704,00016,797,696
3Jun 12, 2026 06:271,699264,063,344247,214,0007,675,00016,797,696
4Jun 12, 2026 06:271,699264,119,311247,276,0007,665,00016,797,696
5Jun 12, 2026 06:271,700264,334,632247,109,0007,937,00016,797,696
6Jun 12, 2026 06:271,701264,389,667247,388,0007,786,00016,797,696
7Jun 12, 2026 06:271,703264,636,059247,749,0007,753,00016,797,696
8Jun 12, 2026 06:271,705265,980,989247,951,0007,845,00016,797,696
9Jun 12, 2026 06:271,706265,034,613248,092,0007,820,00016,797,696