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 04:27Yuriy LyfenkoYuriy LyfenkoScore: 4,287Success
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 04:274,210691,896,150631,565,728016,936,960
2Apr 1, 2023 04:274,212687,500,084631,799,641016,936,960
3Apr 1, 2023 04:274,214694,979,125632,094,716016,908,288
4Apr 1, 2023 04:274,226663,364,005608,930,00024,956,00016,957,440
5Apr 1, 2023 04:274,245659,823,853612,697,00023,988,00016,994,304
6Apr 1, 2023 04:274,278668,716,533614,749,00026,988,00016,957,440
7Apr 1, 2023 04:274,287664,952,538617,120,00025,962,00017,195,008
8Apr 1, 2023 04:274,288667,238,467615,249,00027,965,00017,088,512
9Apr 1, 2023 04:274,293670,942,645616,988,00026,955,00016,953,344
10Apr 1, 2023 04:274,297671,588,398620,555,00023,982,00017,014,784
11Apr 1, 2023 04:274,304669,011,874620,613,00024,984,00016,953,344
12Apr 1, 2023 04:274,307672,786,282620,084,00025,961,00017,022,976