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 03:08Huy Duc LeHuy Duc LeScore: 2,997Success
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 03:082,952514,804,645442,842,594016,957,440
2Mar 7, 2024 03:082,956509,079,483443,359,893016,965,632
3Mar 7, 2024 03:082,960499,744,637443,969,095016,961,536
4Mar 7, 2024 03:082,996480,406,902413,500,00035,956,00017,182,720
5Mar 7, 2024 03:082,996480,586,659420,492,00028,965,00017,006,592
6Mar 7, 2024 03:082,997470,546,862414,567,00034,963,00017,080,320
7Mar 7, 2024 03:082,997472,443,957423,612,00025,976,00017,018,880
8Mar 7, 2024 03:082,998472,921,156417,717,00031,978,00017,014,784
9Mar 7, 2024 03:083,000474,601,738412,967,00036,997,00017,158,144
10Mar 7, 2024 03:083,001472,964,917416,123,00034,010,00017,125,376
11Mar 7, 2024 03:083,002482,659,310419,346,00030,951,00017,022,976
12Mar 7, 2024 03:083,005480,701,615426,824,00023,990,00017,014,784