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 listDec 9, 2025 03:16Yehor BondarYehor BondarScore: 383,917Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2025 03:16381,35357,264,670,83057,160,904,00041,975,00017,051,648
2Dec 9, 2025 03:16382,42557,428,881,40157,321,733,00041,972,00017,006,592
3Dec 9, 2025 03:16382,73957,471,468,97757,372,862,00037,976,00017,043,456
4Dec 9, 2025 03:16383,03457,511,780,97457,416,118,00038,977,00016,969,728
5Dec 9, 2025 03:16383,91757,647,863,02257,539,553,00047,972,00016,969,728
6Dec 9, 2025 03:16384,06557,664,997,16857,570,805,00038,977,00017,104,896
7Dec 9, 2025 03:16384,59657,753,568,45457,646,382,00042,973,00016,945,152
8Dec 9, 2025 03:16385,78157,922,219,36157,815,184,00051,969,00016,957,440
9Dec 9, 2025 03:16386,87958,090,685,93957,983,891,00047,970,00017,072,128