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 24, 2023 16:26Yuriy LyfenkoYuriy LyfenkoScore: 4,588Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2023 16:264,284718,007,219642,527,123016,949,248
2Mar 24, 2023 16:264,286726,541,421642,851,432016,949,248
3Mar 24, 2023 16:264,287709,442,100643,007,235016,957,440
4Mar 24, 2023 16:264,410691,340,687635,519,00025,980,00017,166,336
5Mar 24, 2023 16:264,492704,876,362647,763,00025,990,00017,096,704
6Mar 24, 2023 16:264,508704,142,437649,208,00026,967,00016,965,632
7Mar 24, 2023 16:264,588713,638,478664,250,00023,972,00016,969,728
8Mar 24, 2023 16:264,594715,442,020665,189,00023,970,00017,133,568
9Mar 24, 2023 16:264,595713,854,487665,278,00023,974,00016,957,440
10Mar 24, 2023 16:264,597715,108,533662,567,00026,982,00017,199,104
11Mar 24, 2023 16:264,607714,345,023664,133,00026,964,00016,941,056
12Mar 24, 2023 16:264,619719,915,209668,959,00023,962,00016,973,824