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:48Huy Duc LeHuy Duc LeScore: 4,095Success
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:484,086640,819,812581,946,00030,997,00017,039,360
2Mar 5, 2024 09:484,087684,660,622613,103,360016,908,288
3Mar 5, 2024 09:484,089640,115,689588,359,00025,015,00017,051,648
4Mar 5, 2024 09:484,092639,074,692582,816,00030,990,00016,961,536
5Mar 5, 2024 09:484,093638,922,229586,912,00026,995,00017,195,008
6Mar 5, 2024 09:484,093636,327,699581,958,00031,997,00017,092,608
7Mar 5, 2024 09:484,095689,139,649614,311,462016,912,384
8Mar 5, 2024 09:484,095642,302,338591,175,00023,006,00017,072,128
9Mar 5, 2024 09:484,097636,099,665585,601,00028,980,00017,047,552
10Mar 5, 2024 09:484,098639,572,758589,691,00024,986,00017,055,744
11Mar 5, 2024 09:484,098638,166,891584,708,00029,985,00017,108,992
12Mar 5, 2024 09:484,106689,006,030615,896,913016,908,288