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:32Yuriy LyfenkoYuriy LyfenkoScore: 4,188Success
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:324,133685,780,962619,991,492016,949,248
2Apr 1, 2023 19:324,139687,252,256620,877,447016,936,960
3Apr 1, 2023 19:324,139690,811,481620,902,722016,932,864
4Apr 1, 2023 19:324,176649,798,636605,436,00020,980,00016,957,440
5Apr 1, 2023 19:324,185655,604,607605,772,00021,991,00017,141,760
6Apr 1, 2023 19:324,186660,925,612603,010,00024,959,00016,957,440
7Apr 1, 2023 19:324,188650,925,159602,197,00025,965,00017,190,912
8Apr 1, 2023 19:324,188650,200,350602,202,00025,965,00016,969,728
9Apr 1, 2023 19:324,191651,662,906602,693,00025,986,00016,953,344
10Apr 1, 2023 19:324,195659,172,733604,247,00024,968,00016,949,248
11Apr 1, 2023 19:324,198653,822,741603,689,00025,986,00016,961,536
12Apr 1, 2023 19:324,240662,931,956609,007,00026,956,00017,039,360