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 19, 2023 03:15Yuriy LyfenkoYuriy LyfenkoScore: 3,943Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2023 03:153,924662,994,332588,540,555016,945,152
2Apr 19, 2023 03:153,924648,099,593588,620,015016,941,056
3Apr 19, 2023 03:153,927660,445,272589,019,673016,936,960
4Apr 19, 2023 03:153,940612,968,049567,963,00022,998,00016,957,440
5Apr 19, 2023 03:153,942617,094,394566,248,00025,010,00016,961,536
6Apr 19, 2023 03:153,943619,530,084568,373,00023,015,00017,039,360
7Apr 19, 2023 03:153,943613,593,474561,506,00029,973,00017,084,416
8Apr 19, 2023 03:153,944619,201,978566,633,00024,983,00016,961,536
9Apr 19, 2023 03:153,944613,726,437564,635,00026,982,00016,957,440
10Apr 19, 2023 03:153,945613,043,108562,765,00028,987,00016,953,344
11Apr 19, 2023 03:153,945614,459,974568,778,00022,991,00017,182,720
12Apr 19, 2023 03:153,947615,979,685569,069,00023,002,00017,141,760