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 31, 2024 10:49Andrey LikhachevAndrey LikhachevScore: 4,271Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2024 10:494,240670,225,186626,070,0009,985,00016,302,080
2Aug 31, 2024 10:494,244667,391,544630,677,0005,987,00016,310,272
3Aug 31, 2024 10:494,246668,758,443627,918,0008,984,00016,416,768
4Aug 31, 2024 10:494,255666,149,737627,344,00010,971,00016,302,080
5Aug 31, 2024 10:494,258666,132,012633,645,0004,989,00016,416,768
6Aug 31, 2024 10:494,269666,652,489631,378,0008,991,00016,302,080
7Aug 31, 2024 10:494,271668,695,990632,673,0007,983,00016,306,176
8Aug 31, 2024 10:494,348676,747,373648,151,0003,994,00016,408,576
9Aug 31, 2024 10:494,356681,285,100645,467,0007,981,00016,297,984
10Aug 31, 2024 10:494,360685,355,320643,096,00010,967,00016,416,768
11Aug 31, 2024 10:494,364682,754,836645,581,0008,980,00016,306,176
12Aug 31, 2024 10:494,369686,149,763649,339,0005,993,00016,412,672