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 08:07Huy Duc LeHuy Duc LeScore: 3,087Success
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 08:073,052513,351,602457,802,887016,998,400
2Mar 6, 2024 08:073,056517,881,109458,379,128016,986,112
3Mar 6, 2024 08:073,056514,356,486458,399,743016,994,304
4Mar 6, 2024 08:073,084488,172,481430,597,00031,970,00017,145,856
5Mar 6, 2024 08:073,085491,007,621433,835,00028,988,00017,027,072
6Mar 6, 2024 08:073,086489,043,227434,950,00027,996,00017,195,008
7Mar 6, 2024 08:073,087491,856,286434,055,00029,003,00017,043,456
8Mar 6, 2024 08:073,088490,256,713437,141,00026,008,00017,121,280
9Mar 6, 2024 08:073,088492,897,349435,212,00028,013,00017,043,456
10Mar 6, 2024 08:073,094490,892,500437,067,00027,004,00017,059,840
11Mar 6, 2024 08:073,100487,014,104433,971,00030,997,00017,195,008
12Mar 6, 2024 08:073,101493,820,932434,160,00031,011,00017,055,744