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 listApr 1, 2025 20:42Aniruddha DebAniruddha DebScore: 59,123Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2025 20:4259,0348,892,519,6818,850,176,0004,991,00016,953,344
2Apr 1, 2025 20:4259,0368,894,801,1298,852,474,0002,994,00016,953,344
3Apr 1, 2025 20:4259,0488,900,138,8318,854,221,0002,994,00016,953,344
4Apr 1, 2025 20:4259,1218,911,613,9068,866,116,0001,995,00016,953,344
5Apr 1, 2025 20:4259,1238,905,809,3978,866,444,0001,996,00016,953,344
6Apr 1, 2025 20:4259,1588,922,006,5948,870,696,0002,994,00016,953,344
7Apr 1, 2025 20:4259,2678,931,634,2658,888,093,0001,996,00017,113,088
8Apr 1, 2025 20:4259,2858,928,586,6808,888,829,0003,992,00016,953,344
9Apr 1, 2025 20:4259,3018,936,038,9528,888,089,0006,986,00017,195,008