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:34Huy Duc LeHuy Duc LeScore: 3,570Success
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:343,525600,407,992528,766,718016,945,152
2Mar 7, 2024 00:343,527580,028,801529,037,658016,969,728
3Mar 7, 2024 00:343,530594,290,323529,482,663016,961,536
4Mar 7, 2024 00:343,568564,154,791500,147,00035,010,00017,018,880
5Mar 7, 2024 00:343,569566,109,830496,440,00038,956,00017,014,784
6Mar 7, 2024 00:343,570566,052,620502,476,00032,965,00017,080,320
7Mar 7, 2024 00:343,570561,643,913504,485,00030,968,00017,195,008
8Mar 7, 2024 00:343,570560,120,198505,500,00029,970,00017,158,144
9Mar 7, 2024 00:343,571563,348,123509,626,00025,980,00017,031,168
10Mar 7, 2024 00:343,571557,612,380505,721,00029,983,00017,014,784
11Mar 7, 2024 00:343,573561,728,966510,918,00024,996,00017,014,784
12Mar 7, 2024 00:343,577566,726,908502,529,00033,968,00017,072,128