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 24, 2026 11:37anboto1anboto1Score: 4,139Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 11:374,127628,268,713599,165,00019,972,00016,793,600
2Jun 24, 2026 11:374,134629,293,018600,368,00019,813,00016,793,600
3Jun 24, 2026 11:374,136629,745,993600,841,00019,701,00016,793,600
4Jun 24, 2026 11:374,139630,596,385601,219,00019,731,00016,793,600
5Jun 24, 2026 11:374,139630,182,617600,814,00020,105,00016,793,600
6Jun 24, 2026 11:374,142630,596,397601,239,00020,080,00016,793,600
7Jun 24, 2026 11:374,145630,997,069602,089,00019,698,00016,793,600
8Jun 24, 2026 11:374,146631,256,746602,074,00019,889,00016,793,600
9Jun 24, 2026 11:374,147631,317,878602,300,00019,761,00016,793,600