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:37Yuriy LyfenkoYuriy LyfenkoScore: 4,219Success
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:374,174692,444,463626,094,667016,941,056
2Apr 1, 2023 19:374,176687,284,731626,354,413016,941,056
3Apr 1, 2023 19:374,177685,459,923626,487,819016,945,152
4Apr 1, 2023 19:374,204649,187,488608,649,00021,987,00017,084,416
5Apr 1, 2023 19:374,214667,461,104606,086,00025,960,00016,957,440
6Apr 1, 2023 19:374,218670,725,671610,697,00021,989,00016,990,208
7Apr 1, 2023 19:374,219663,865,844607,936,00024,956,00016,953,344
8Apr 1, 2023 19:374,224660,022,930607,629,00025,984,00016,957,440
9Apr 1, 2023 19:374,225660,111,068608,722,00024,988,00017,084,416
10Apr 1, 2023 19:374,228665,829,344607,279,00026,967,00016,994,304
11Apr 1, 2023 19:374,229660,449,815609,308,00024,971,00017,190,912
12Apr 1, 2023 19:374,281670,374,122620,145,00021,969,00017,174,528