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 08:31Huy Duc LeHuy Duc LeScore: 4,161Success
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 08:314,141673,845,502621,141,056016,904,192
2Mar 5, 2024 08:314,152644,318,990591,853,00030,992,00017,051,648
3Mar 5, 2024 08:314,157648,678,534594,532,00028,977,00017,174,528
4Mar 5, 2024 08:314,159645,179,464598,887,00024,995,00017,047,552
5Mar 5, 2024 08:314,160648,177,792588,945,00034,996,00017,047,552
6Mar 5, 2024 08:314,160649,180,024594,065,00030,003,00017,125,376
7Mar 5, 2024 08:314,161649,839,114595,120,00029,005,00017,039,360
8Mar 5, 2024 08:314,162652,055,471593,337,00030,965,00017,051,648
9Mar 5, 2024 08:314,165646,997,026594,781,00029,988,00017,051,648
10Mar 5, 2024 08:314,278711,636,612641,677,741016,904,192
11Mar 5, 2024 08:314,283707,203,730642,392,842017,022,976
12Mar 5, 2024 08:314,298672,986,903614,667,00029,983,00017,059,840