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 12, 2025 00:50SergeBouSergeBouScore: 61,424Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2025 00:5061,3849,242,246,4319,161,666,00045,943,00017,227,776
2Aug 12, 2025 00:5061,3889,248,526,8619,170,196,00037,951,00017,035,264
3Aug 12, 2025 00:5061,4039,255,940,7759,172,535,00037,952,00017,190,912
4Aug 12, 2025 00:5061,4209,252,185,5349,161,079,00051,932,00017,227,776
5Aug 12, 2025 00:5061,4249,257,296,9029,166,714,00046,942,00016,998,400
6Aug 12, 2025 00:5061,4369,255,193,5899,179,375,00035,954,00017,125,376
7Aug 12, 2025 00:5061,4479,257,570,8469,174,173,00042,949,00016,990,208
8Aug 12, 2025 00:5061,4629,253,230,3959,171,296,00047,944,00017,211,392
9Aug 12, 2025 00:5061,4729,263,071,7259,171,806,00048,940,00017,178,624