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 listApr 1, 2023 03:48Yuriy LyfenkoYuriy LyfenkoScore: 4,759Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2023 03:484,654770,884,728698,078,953016,920,576
2Apr 1, 2023 03:484,661757,195,555699,117,919016,920,576
3Apr 1, 2023 03:484,668772,136,760700,125,337016,920,576
4Apr 1, 2023 03:484,722739,817,526676,392,00031,971,00017,141,760
5Apr 1, 2023 03:484,741735,394,064676,189,00034,958,00017,080,320
6Apr 1, 2023 03:484,747734,644,912679,034,00032,953,00017,096,704
7Apr 1, 2023 03:484,759745,639,299679,879,00033,944,00017,195,008
8Apr 1, 2023 03:484,766742,454,495684,905,00029,952,00017,174,528
9Apr 1, 2023 03:484,783746,873,458690,479,00026,940,00016,953,344
10Apr 1, 2023 03:484,801746,174,450687,224,00032,962,00017,068,032
11Apr 1, 2023 03:484,812749,767,045689,835,00031,946,00017,084,416
12Apr 1, 2023 03:484,857752,849,275700,659,00027,946,00017,072,128