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 6, 2024 08:06Huy Duc LeHuy Duc LeScore: 3,090Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2024 08:063,056518,072,409458,385,142016,990,208
2Mar 6, 2024 08:063,057534,294,043458,539,998016,986,112
3Mar 6, 2024 08:063,060530,582,385459,034,357016,986,112
4Mar 6, 2024 08:063,089493,921,292425,295,00038,026,00017,043,456
5Mar 6, 2024 08:063,089494,398,384435,306,00028,019,00017,207,296
6Mar 6, 2024 08:063,090490,704,169429,510,00033,961,00016,982,016
7Mar 6, 2024 08:063,090493,876,102438,535,00024,973,00017,055,744
8Mar 6, 2024 08:063,092494,501,597432,799,00030,985,00017,055,744
9Mar 6, 2024 08:063,093486,877,385429,967,00033,997,00017,059,840
10Mar 6, 2024 08:063,095493,496,066436,226,00028,014,00017,203,200
11Mar 6, 2024 08:063,096491,097,873436,371,00027,959,00017,051,648
12Mar 6, 2024 08:063,099492,726,305436,803,00027,987,00017,047,552