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:26Huy Duc LeHuy Duc LeScore: 3,085Success
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:263,055520,207,527458,246,852016,994,304
2Mar 6, 2024 08:263,058519,929,838458,648,570016,998,400
3Mar 6, 2024 08:263,060514,469,782459,007,160016,998,400
4Mar 6, 2024 08:263,081486,510,102434,174,00028,011,00017,047,552
5Mar 6, 2024 08:263,081490,626,315430,193,00032,014,00017,047,552
6Mar 6, 2024 08:263,085485,950,220432,723,00029,980,00017,154,048
7Mar 6, 2024 08:263,085491,229,748436,743,00025,984,00017,117,184
8Mar 6, 2024 08:263,087489,288,929433,052,00030,003,00017,195,008
9Mar 6, 2024 08:263,090490,008,244439,510,00023,973,00017,043,456
10Mar 6, 2024 08:263,092490,102,441440,869,00022,993,00017,043,456
11Mar 6, 2024 08:263,098485,608,386431,766,00032,982,00016,949,248
12Mar 6, 2024 08:263,105491,733,141429,707,00035,975,00017,051,648