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 7, 2024 02:23Huy Duc LeHuy Duc LeScore: 3,004Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2024 02:232,989478,186,315418,395,00029,956,00016,965,632
2Mar 7, 2024 02:232,999477,068,306422,858,00026,990,00017,010,688
3Mar 7, 2024 02:232,999477,366,921418,904,00030,992,00017,018,880
4Mar 7, 2024 02:233,001473,168,183420,079,00030,005,00017,108,992
5Mar 7, 2024 02:233,001477,930,140425,136,00025,008,00017,178,624
6Mar 7, 2024 02:233,001471,155,628420,172,00030,012,00017,014,784
7Mar 7, 2024 02:233,004475,773,705419,579,00030,968,00017,133,568
8Mar 7, 2024 02:233,007478,229,012419,062,00032,004,00017,129,472
9Mar 7, 2024 02:233,008478,719,221418,172,00033,013,00017,100,800
10Mar 7, 2024 02:233,150537,256,894472,559,715016,973,824
11Mar 7, 2024 02:233,151536,335,037472,644,946016,957,440
12Mar 7, 2024 02:233,152529,351,559472,797,589016,965,632