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:24Yuriy LyfenkoYuriy LyfenkoScore: 4,202Success
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:244,147675,439,111622,039,837016,936,960
2Apr 1, 2023 19:244,149692,783,361622,385,839016,945,152
3Apr 1, 2023 19:244,154693,186,656623,083,008016,936,960
4Apr 1, 2023 19:244,189651,975,634603,408,00024,975,00017,039,360
5Apr 1, 2023 19:244,195653,662,644602,328,00026,969,00017,031,168
6Apr 1, 2023 19:244,199662,617,889605,802,00023,992,00016,957,440
7Apr 1, 2023 19:244,202656,474,920608,315,00021,975,00016,957,440
8Apr 1, 2023 19:244,204659,121,503608,614,00021,986,00017,072,128
9Apr 1, 2023 19:244,210660,165,573608,536,00022,982,00017,125,376
10Apr 1, 2023 19:244,215653,979,023607,284,00024,970,00016,994,304
11Apr 1, 2023 19:244,217657,174,493606,503,00025,978,00017,145,856
12Apr 1, 2023 19:244,273664,825,195614,971,00025,956,00017,014,784