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:18Huy Duc LeHuy Duc LeScore: 4,276Success
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:184,243666,551,586598,493,00037,967,00017,190,912
2Mar 5, 2024 08:184,253658,382,771595,963,00041,997,00017,170,432
3Mar 5, 2024 08:184,262669,358,620604,232,00035,013,00017,190,912
4Mar 5, 2024 08:184,262665,620,830604,263,00035,015,00017,190,912
5Mar 5, 2024 08:184,264667,745,118601,563,00037,972,00017,084,416
6Mar 5, 2024 08:184,268669,917,315600,168,00040,011,00017,174,528
7Mar 5, 2024 08:184,276668,038,124604,491,00036,968,00016,965,632
8Mar 5, 2024 08:184,286668,465,126606,894,00035,993,00016,953,344
9Mar 5, 2024 08:184,291671,393,200603,653,00039,977,00017,182,720
10Mar 5, 2024 08:184,378721,569,832656,771,251016,920,576
11Mar 5, 2024 08:184,417733,628,150662,609,339016,896,000
12Mar 5, 2024 08:184,426736,225,796663,973,636016,908,288