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 16, 2025 15:49Aniruddha DebAniruddha DebScore: 3,996Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2025 15:493,974629,324,386596,060,000017,211,392
2Aug 16, 2025 15:493,974617,502,143594,157,0002,000,00017,211,392
3Aug 16, 2025 15:493,992621,283,411598,773,000016,949,248
4Aug 16, 2025 15:493,993629,420,267599,003,000017,211,392
5Aug 16, 2025 15:493,996629,744,160597,462,0001,998,00016,957,440
6Aug 16, 2025 15:494,003628,597,433598,380,0001,997,00017,158,144
7Aug 16, 2025 15:494,014625,982,359602,123,000017,158,144
8Aug 16, 2025 15:494,064634,532,440605,551,0003,997,00017,162,240
9Aug 16, 2025 15:494,131640,039,649618,657,000999,00017,162,240