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:18Huy Duc LeHuy Duc LeScore: 3,118Success
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:183,110498,131,164432,533,00033,963,00017,031,168
2Mar 6, 2024 16:183,112489,334,650428,799,00037,982,00017,104,896
3Mar 6, 2024 16:183,112488,659,750439,864,00026,991,00017,195,008
4Mar 6, 2024 16:183,114496,795,621438,103,00029,006,00017,108,992
5Mar 6, 2024 16:183,115490,900,201431,220,00036,018,00017,018,880
6Mar 6, 2024 16:183,117490,111,857436,612,00030,972,00017,039,360
7Mar 6, 2024 16:183,118488,481,222436,742,00030,981,00017,022,976
8Mar 6, 2024 16:183,119491,197,515435,918,00031,994,00017,149,952
9Mar 6, 2024 16:183,124494,969,318434,626,00033,970,00017,022,976
10Mar 6, 2024 16:183,757632,111,991563,512,160016,953,344
11Mar 6, 2024 16:183,761627,760,502564,117,219016,961,536
12Mar 6, 2024 16:183,764632,651,028564,666,327016,961,536