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:58Victor MerckléVictor MerckléScore: 1,741Success
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:591,740270,119,130253,340,0007,667,00016,797,696
2Jun 7, 2026 12:591,740270,388,170253,234,0007,769,00016,797,696
3Jun 7, 2026 12:591,740270,334,619253,431,0007,712,00016,797,696
4Jun 7, 2026 12:591,741270,262,584253,497,0007,657,00016,797,696
5Jun 7, 2026 12:591,741270,479,045253,426,0007,779,00016,797,696
6Jun 7, 2026 12:591,741270,431,472253,487,0007,736,00016,797,696
7Jun 7, 2026 12:591,745271,121,014254,120,0007,767,00016,797,696
8Jun 7, 2026 12:591,746271,082,231254,203,0007,779,00016,797,696
9Jun 7, 2026 12:591,747271,278,759254,402,0007,764,00016,797,696