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 listMar 5, 2024 09:45Huy Duc LeHuy Duc LeScore: 4,094Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 5, 2024 09:454,087675,851,847613,043,497016,900,096
2Mar 5, 2024 09:454,087641,749,608584,006,00029,000,00017,035,264
3Mar 5, 2024 09:454,089673,871,368613,367,967016,912,384
4Mar 5, 2024 09:454,090642,731,773586,479,00026,976,00017,051,648
5Mar 5, 2024 09:454,090645,505,915580,581,00032,976,00017,043,456
6Mar 5, 2024 09:454,093637,783,551583,929,00029,996,00017,043,456
7Mar 5, 2024 09:454,094639,150,407583,027,00031,001,00017,195,008
8Mar 5, 2024 09:454,095636,425,964584,199,00030,010,00017,088,512
9Mar 5, 2024 09:454,097642,984,960583,514,00030,974,00017,055,744
10Mar 5, 2024 09:454,098674,552,841614,759,691016,908,288
11Mar 5, 2024 09:454,098638,240,595588,716,00025,987,00017,059,840
12Mar 5, 2024 09:454,099642,634,011587,821,00026,991,00017,055,744