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:38Yuriy LyfenkoYuriy LyfenkoScore: 4,225Success
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:384,140684,773,384621,027,819016,945,152
2Apr 1, 2023 19:384,143701,076,725621,463,961016,941,056
3Apr 1, 2023 19:384,145682,100,570621,747,969016,932,864
4Apr 1, 2023 19:384,171655,337,832598,637,00026,983,00017,035,264
5Apr 1, 2023 19:384,213657,614,047605,970,00025,955,00016,961,536
6Apr 1, 2023 19:384,224655,279,909610,569,00022,983,00016,957,440
7Apr 1, 2023 19:384,225669,765,674609,817,00023,992,00016,957,440
8Apr 1, 2023 19:384,228658,297,475608,188,00025,965,00016,998,400
9Apr 1, 2023 19:384,235663,861,010611,269,00023,971,00017,035,264
10Apr 1, 2023 19:384,237659,302,231611,611,00023,984,00017,207,296
11Apr 1, 2023 19:384,248665,805,220611,216,00025,966,00017,178,624
12Apr 1, 2023 19:384,252661,482,144612,887,00024,954,00016,957,440