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 listAug 23, 2026 16:12Navneet RajNavneet RajScore: 12,561Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 16:1312,5241,888,840,0551,859,373,00019,235,00016,793,600
2Aug 23, 2026 16:1312,5261,889,795,3251,859,119,00019,902,00016,793,600
3Aug 23, 2026 16:1312,5501,892,579,9081,863,735,00018,873,00016,793,600
4Aug 23, 2026 16:1312,5571,893,420,7691,864,378,00019,208,00016,793,600
5Aug 23, 2026 16:1312,5611,895,237,9651,865,179,00018,972,00016,793,600
6Aug 23, 2026 16:1312,6301,904,605,8781,875,380,00019,263,00016,793,600
7Aug 23, 2026 16:1312,6371,906,142,8651,875,981,00019,654,00016,793,600
8Aug 23, 2026 16:1312,6371,905,645,0131,876,254,00019,435,00016,793,600
9Aug 23, 2026 16:1313,2272,004,853,4561,966,867,00017,241,00016,793,600