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 05:10Yuriy LyfenkoYuriy LyfenkoScore: 4,527Success
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 05:104,302727,604,212645,365,732016,953,344
2Mar 21, 2023 05:104,349723,051,851652,350,084016,945,152
3Mar 21, 2023 05:104,351720,209,707652,618,826016,949,248
4Mar 21, 2023 05:104,393688,737,303635,002,00023,962,00017,100,800
5Mar 21, 2023 05:104,439693,266,614639,900,00025,955,00017,072,128
6Mar 21, 2023 05:104,517700,733,004650,603,00026,983,00017,141,760
7Mar 21, 2023 05:104,527702,764,163654,115,00024,966,00017,068,032
8Mar 21, 2023 05:104,531707,072,546656,708,00022,954,00017,022,976
9Mar 21, 2023 05:104,538709,022,778656,732,00023,990,00016,957,440
10Mar 21, 2023 05:104,551716,554,282657,696,00024,950,00016,990,208
11Mar 21, 2023 05:104,553712,199,781658,006,00024,962,00016,957,440
12Mar 21, 2023 05:104,595708,106,281663,314,00025,973,00016,990,208