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 20:46Yuriy 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 20:463,922666,099,847588,246,130016,936,960
2Apr 1, 2023 20:463,923645,548,108588,448,894016,932,864
3Apr 1, 2023 20:463,923654,256,511588,498,252016,941,056
4Apr 1, 2023 20:463,943615,283,591563,440,00027,972,00016,957,440
5Apr 1, 2023 20:463,944616,249,935551,612,00039,971,00016,961,536
6Apr 1, 2023 20:463,944616,688,204567,631,00023,984,00016,961,536
7Apr 1, 2023 20:463,944616,299,716567,642,00023,984,00016,957,440
8Apr 1, 2023 20:463,944617,632,481564,647,00026,983,00016,961,536
9Apr 1, 2023 20:463,944626,977,661562,666,00028,982,00016,957,440
10Apr 1, 2023 20:463,945614,313,196568,825,00022,992,00017,084,416
11Apr 1, 2023 20:463,946622,441,289568,948,00022,997,00016,957,440
12Apr 1, 2023 20:463,948615,160,417565,122,00027,005,00017,190,912