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 24, 2023 16:09Yuriy LyfenkoYuriy LyfenkoScore: 4,481Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2023 16:094,259692,369,950638,907,571016,957,440
2Mar 24, 2023 16:094,262707,753,160639,332,462016,949,248
3Mar 24, 2023 16:094,283711,533,782642,407,237016,945,152
4Mar 24, 2023 16:094,379682,285,880632,825,00023,955,00017,178,624
5Mar 24, 2023 16:094,388682,703,412631,172,00026,964,00017,117,184
6Mar 24, 2023 16:094,460699,625,922648,039,00020,968,00017,100,800
7Mar 24, 2023 16:094,481695,581,545646,130,00025,965,00016,957,440
8Mar 24, 2023 16:094,487696,800,458650,114,00022,968,00016,965,632
9Mar 24, 2023 16:094,502702,723,833648,336,00026,972,00017,002,496
10Mar 24, 2023 16:094,538709,889,268657,659,00022,988,00016,965,632
11Mar 24, 2023 16:094,572707,468,604660,886,00024,957,00017,088,512
12Mar 24, 2023 16:094,607719,161,597665,026,00025,961,00017,022,976