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 16:19Huy Duc LeHuy Duc LeScore: 3,175Success
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 16:193,094533,921,887464,114,734016,969,728
2Mar 6, 2024 16:193,097538,738,037464,476,095016,957,440
3Mar 6, 2024 16:193,106528,339,595465,876,912016,961,536
4Mar 6, 2024 16:193,163501,504,470442,510,00031,964,00017,022,976
5Mar 6, 2024 16:193,165498,223,556445,763,00028,984,00017,027,072
6Mar 6, 2024 16:193,174499,068,306448,088,00028,005,00017,018,880
7Mar 6, 2024 16:193,175502,550,928442,287,00034,022,00017,199,104
8Mar 6, 2024 16:193,179499,350,663441,862,00034,989,00017,031,168
9Mar 6, 2024 16:193,181507,207,019443,128,00034,009,00016,977,920
10Mar 6, 2024 16:193,183511,073,506445,494,00031,963,00017,190,912
11Mar 6, 2024 16:193,185506,865,795446,741,00030,982,00017,035,264
12Mar 6, 2024 16:193,190504,877,032443,515,00034,961,00017,031,168