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 00:44Huy Duc LeHuy Duc LeScore: 3,024Success
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 00:442,965505,360,284444,739,833016,961,536
2Mar 7, 2024 00:442,977522,287,303446,504,250016,965,632
3Mar 7, 2024 00:442,978512,059,432446,700,919016,965,632
4Mar 7, 2024 00:443,016479,289,026423,388,00029,026,00017,145,856
5Mar 7, 2024 00:443,018477,204,138422,768,00029,983,00017,039,360
6Mar 7, 2024 00:443,020481,820,788415,002,00038,000,00017,108,992
7Mar 7, 2024 00:443,024479,645,868421,587,00031,968,00017,018,880
8Mar 7, 2024 00:443,025478,050,297422,768,00030,983,00016,949,248
9Mar 7, 2024 00:443,025483,656,533420,783,00032,983,00017,018,880
10Mar 7, 2024 00:443,025486,984,089422,833,00030,987,00017,149,952
11Mar 7, 2024 00:443,026480,739,665421,909,00031,993,00017,027,072
12Mar 7, 2024 00:443,032477,041,779421,784,00032,983,00017,080,320