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:10Yuriy LyfenkoYuriy LyfenkoScore: 4,253Success
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:104,179692,617,005626,890,800016,936,960
2Apr 1, 2023 15:104,181707,073,587627,082,437016,941,056
3Apr 1, 2023 15:104,184697,475,577627,623,605016,941,056
4Apr 1, 2023 15:104,208657,690,121603,168,00027,961,00017,145,856
5Apr 1, 2023 15:104,248666,016,176610,290,00026,968,00017,059,840
6Apr 1, 2023 15:104,250666,381,477610,469,00026,976,00016,957,440
7Apr 1, 2023 15:104,253665,126,952614,036,00023,962,00017,190,912
8Apr 1, 2023 15:104,258671,878,157612,672,00025,986,00016,953,344
9Apr 1, 2023 15:104,261666,674,293615,161,00023,967,00017,047,552
10Apr 1, 2023 15:104,263666,976,592613,499,00025,978,00017,076,224
11Apr 1, 2023 15:104,264671,061,613617,638,00021,987,00017,149,952
12Apr 1, 2023 15:104,268662,578,557615,288,00024,971,00017,047,552