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 21:29Aniruddha DebAniruddha DebScore: 4,834Success
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 21:294,820750,681,452722,015,0001,000,00017,199,104
2Apr 1, 2025 21:294,825747,547,726721,777,0001,999,00016,945,152
3Apr 1, 2025 21:294,833745,785,864723,894,000999,00017,207,296
4Apr 1, 2025 21:294,833752,600,636723,996,000999,00016,945,152
5Apr 1, 2025 21:294,834745,476,523724,159,0001,000,00017,203,200
6Apr 1, 2025 21:294,835749,544,676723,245,0001,997,00017,203,200
7Apr 1, 2025 21:294,836748,064,560722,415,0002,997,00017,117,184
8Apr 1, 2025 21:294,840748,951,754724,977,000999,00017,113,088
9Apr 1, 2025 21:294,881766,689,335731,129,0001,000,00017,108,992