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 15:11Yuriy LyfenkoYuriy LyfenkoScore: 4,259Success
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 15:114,161684,592,156624,196,738016,936,960
2Apr 1, 2023 15:114,163685,685,547624,456,249016,936,960
3Apr 1, 2023 15:114,167699,642,864624,990,061016,949,248
4Apr 1, 2023 15:114,225661,467,315609,728,00023,989,00017,051,648
5Apr 1, 2023 15:114,231660,377,529609,672,00024,986,00017,088,512
6Apr 1, 2023 15:114,255665,374,248612,309,00025,970,00016,949,248
7Apr 1, 2023 15:114,259665,756,086614,803,00023,992,00017,125,376
8Apr 1, 2023 15:114,262667,880,316615,329,00023,973,00017,022,976
9Apr 1, 2023 15:114,269662,188,533618,343,00021,976,00016,961,536
10Apr 1, 2023 15:114,272671,506,615616,755,00023,990,00016,961,536
11Apr 1, 2023 15:114,274666,760,880619,200,00021,971,00016,957,440
12Apr 1, 2023 15:114,280666,981,422616,085,00025,961,00016,961,536