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:28Huy Duc LeHuy Duc LeScore: 4,162Success
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:284,150645,318,648596,524,00025,979,00017,133,568
2Mar 5, 2024 08:284,156694,527,216623,458,062016,900,096
3Mar 5, 2024 08:284,157652,000,802594,628,00028,981,00017,043,456
4Mar 5, 2024 08:284,157647,118,655592,641,00030,981,00017,149,952
5Mar 5, 2024 08:284,158652,590,692600,650,00022,986,00017,178,624
6Mar 5, 2024 08:284,161651,913,315592,135,00032,007,00017,055,744
7Mar 5, 2024 08:284,162698,735,875624,283,081017,027,072
8Mar 5, 2024 08:284,162650,469,469597,234,00027,010,00016,965,632
9Mar 5, 2024 08:284,162652,436,261599,312,00025,013,00017,129,472
10Mar 5, 2024 08:284,163653,837,026599,536,00024,980,00017,051,648
11Mar 5, 2024 08:284,174649,357,635596,161,00030,008,00017,039,360
12Mar 5, 2024 08:284,286699,592,366642,879,015016,912,384