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 listOct 21, 2025 15:16AnSaAnSaScore: 3,832Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2025 15:163,831603,068,538569,715,0004,997,00016,195,584
2Oct 21, 2025 15:163,831605,253,956570,719,0003,998,00016,191,488
3Oct 21, 2025 15:163,832601,325,766569,734,0004,997,00016,195,584
4Oct 21, 2025 15:163,832598,412,732571,741,0002,998,00016,265,216
5Oct 21, 2025 15:163,832604,614,637569,751,0004,997,00016,191,488
6Oct 21, 2025 15:163,832604,342,486569,773,0004,998,00016,191,488
7Oct 21, 2025 15:163,832601,440,577569,803,0004,998,00016,179,200
8Oct 21, 2025 15:163,832607,956,288569,820,0004,998,00016,195,584
9Oct 21, 2025 15:163,833597,458,019570,979,0003,999,00016,191,488