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 21, 2023 04:16Yuriy LyfenkoYuriy LyfenkoScore: 4,377Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2023 04:164,318671,151,443620,742,00026,988,00016,965,632
2Mar 21, 2023 04:164,335675,103,226622,341,00027,970,00016,965,632
3Mar 21, 2023 04:164,337680,586,783624,526,00025,980,00016,965,632
4Mar 21, 2023 04:164,344677,099,989623,652,00027,984,00017,014,784
5Mar 21, 2023 04:164,350678,479,967627,556,00024,982,00017,068,032
6Mar 21, 2023 04:164,372678,169,610633,736,00021,990,00017,108,992
7Mar 21, 2023 04:164,377687,537,824632,498,00023,980,00016,973,824
8Mar 21, 2023 04:164,378680,217,269629,714,00026,987,00017,145,856
9Mar 21, 2023 04:164,410683,965,119637,470,00023,980,00016,965,632
10Mar 21, 2023 04:164,428744,248,877664,237,817016,949,248
11Mar 21, 2023 04:164,440721,871,048666,055,179016,953,344
12Mar 21, 2023 04:164,451723,608,121667,677,496016,945,152