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:42Huy Duc LeHuy Duc LeScore: 3,018Success
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:422,963501,184,172444,432,458016,961,536
2Mar 7, 2024 00:422,969499,539,089445,413,319016,965,632
3Mar 7, 2024 00:422,971503,136,126445,673,420016,961,536
4Mar 7, 2024 00:423,011481,974,472422,689,00028,978,00017,195,008
5Mar 7, 2024 00:423,011475,546,656418,744,00032,979,00017,104,896
6Mar 7, 2024 00:423,011478,354,024422,741,00028,982,00017,092,608
7Mar 7, 2024 00:423,018481,360,442426,653,00025,978,00017,022,976
8Mar 7, 2024 00:423,019478,284,740423,873,00028,991,00017,018,880
9Mar 7, 2024 00:423,024476,971,707417,569,00035,962,00017,088,512
10Mar 7, 2024 00:423,024475,746,692418,679,00034,973,00017,125,376
11Mar 7, 2024 00:423,027481,336,106424,070,00030,004,00017,178,624
12Mar 7, 2024 00:423,033481,538,510427,955,00026,997,00016,982,016