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 listSep 15, 2026 15:25Haha ExpertHaha ExpertScore: 12,732Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 15:2912,6951,914,940,9991,872,185,00032,097,00016,793,600
2Sep 15, 2026 15:2912,6961,915,553,3251,873,547,00030,872,00016,793,600
3Sep 15, 2026 15:2912,7221,918,801,7241,878,515,00029,869,00016,793,600
4Sep 15, 2026 15:2912,7271,919,530,4151,878,318,00030,798,00016,793,600
5Sep 15, 2026 15:2912,7321,921,439,6821,879,179,00030,705,00016,793,600
6Sep 15, 2026 15:2912,7721,926,086,3781,884,127,00031,687,00016,793,600
7Sep 15, 2026 15:2912,7791,927,210,7931,885,163,00031,711,00016,793,600
8Sep 15, 2026 15:2913,8962,095,547,7342,053,270,00031,253,00016,793,600
9Sep 15, 2026 15:2913,8982,095,113,6062,053,181,00031,603,00016,793,600