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 15, 2026 22:49izotoffizotoffScore: 3,209Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 22:523,188490,079,869468,971,0009,343,00016,818,176
2Oct 15, 2026 22:523,191490,534,351469,397,0009,377,00016,818,176
3Oct 15, 2026 22:523,194490,964,675469,909,0009,221,00016,818,176
4Oct 15, 2026 22:523,197491,241,807470,346,0009,338,00016,818,176
5Oct 15, 2026 22:523,209493,023,807471,118,00010,334,00016,818,176
6Oct 15, 2026 22:523,210493,093,206472,245,0009,344,00016,818,176
7Oct 15, 2026 22:523,227495,081,539473,785,00010,358,00016,818,176
8Oct 15, 2026 22:523,228495,688,230473,908,00010,358,00016,818,176
9Oct 15, 2026 22:523,236497,358,833474,864,00010,674,00016,818,176