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:20Yuriy LyfenkoYuriy LyfenkoScore: 4,472Success
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:204,276714,506,801641,341,713016,953,344
2Mar 24, 2023 16:204,280704,445,977642,001,479016,949,248
3Mar 24, 2023 16:204,302711,264,580645,310,599016,949,248
4Mar 24, 2023 16:204,349678,675,543628,387,00023,976,00016,953,344
5Mar 24, 2023 16:204,362680,280,607628,257,00025,969,00016,965,632
6Mar 24, 2023 16:204,379681,537,040630,929,00025,955,00016,965,632
7Mar 24, 2023 16:204,472699,363,225647,831,00022,994,00017,190,912
8Mar 24, 2023 16:204,506705,005,946654,996,00020,967,00016,965,632
9Mar 24, 2023 16:204,526707,516,314656,886,00021,962,00016,957,440
10Mar 24, 2023 16:204,572711,503,157658,873,00026,953,00017,047,552
11Mar 24, 2023 16:204,589711,537,399664,329,00023,975,00017,018,880
12Mar 24, 2023 16:204,625723,693,040668,828,00024,993,00016,969,728