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 21:23Yuriy LyfenkoYuriy LyfenkoScore: 3,944Success
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 21:233,920646,443,319588,051,806016,941,056
2Apr 1, 2023 21:233,922666,078,245588,271,807016,941,056
3Apr 1, 2023 21:233,923653,247,900588,393,839016,936,960
4Apr 1, 2023 21:233,942621,536,627567,269,00024,011,00017,043,456
5Apr 1, 2023 21:233,942618,224,881564,277,00027,013,00016,957,440
6Apr 1, 2023 21:233,944621,291,148567,558,00023,981,00016,969,728
7Apr 1, 2023 21:233,944613,472,478564,578,00026,979,00016,949,248
8Apr 1, 2023 21:233,945616,457,277566,710,00024,987,00016,945,152
9Apr 1, 2023 21:233,945613,803,534563,757,00027,987,00016,953,344
10Apr 1, 2023 21:233,945621,006,291564,779,00026,989,00017,039,360
11Apr 1, 2023 21:233,946617,431,582563,963,00027,998,00017,100,800
12Apr 1, 2023 21:233,950618,850,007568,518,00023,979,00016,957,440