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 19:34Yuriy LyfenkoYuriy LyfenkoScore: 4,199Success
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 19:344,134692,622,817620,029,690016,945,152
2Apr 1, 2023 19:344,138698,216,911620,749,483016,941,056
3Apr 1, 2023 19:344,140688,314,307620,981,432016,936,960
4Apr 1, 2023 19:344,187653,293,389606,024,00021,964,00017,014,784
5Apr 1, 2023 19:344,196652,782,456606,477,00022,980,00016,953,344
6Apr 1, 2023 19:344,198657,047,646601,796,00027,944,00016,961,536
7Apr 1, 2023 19:344,199655,786,613602,946,00026,952,00017,092,608
8Apr 1, 2023 19:344,202653,628,125605,267,00024,969,00016,969,728
9Apr 1, 2023 19:344,215662,381,820603,332,00028,967,00017,039,360
10Apr 1, 2023 19:344,215653,523,748605,353,00026,971,00017,006,592
11Apr 1, 2023 19:344,248664,125,800612,225,00024,968,00017,084,416
12Apr 1, 2023 19:344,249660,675,443614,399,00022,977,00017,117,184