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:57Yuriy LyfenkoYuriy LyfenkoScore: 4,206Success
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:574,142677,985,146621,325,335016,936,960
2Apr 1, 2023 19:574,145689,799,735621,789,975016,936,960
3Apr 1, 2023 19:574,152687,248,999622,737,251016,941,056
4Apr 1, 2023 19:574,176648,155,597599,423,00026,974,00017,096,704
5Apr 1, 2023 19:574,194653,273,506603,134,00025,962,00017,031,168
6Apr 1, 2023 19:574,195653,316,316607,253,00021,972,00017,072,128
7Apr 1, 2023 19:574,206661,753,481604,994,00025,956,00016,957,440
8Apr 1, 2023 19:574,206663,106,728606,956,00023,998,00016,957,440
9Apr 1, 2023 19:574,211657,357,805607,730,00023,989,00016,957,440
10Apr 1, 2023 19:574,226658,878,734607,976,00025,956,00017,158,144
11Apr 1, 2023 19:574,227667,329,338608,037,00025,958,00017,072,128
12Apr 1, 2023 19:574,230661,058,404609,513,00024,980,00017,035,264