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:11Yuriy LyfenkoYuriy LyfenkoScore: 4,206Success
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:114,1551,191,225,738623,255,632016,945,152
2Apr 1, 2023 19:114,1581,185,842,655623,700,906016,936,960
3Apr 1, 2023 19:114,1601,192,729,815623,955,864017,006,592
4Apr 1, 2023 19:114,2031,158,126,027601,410,00028,971,00017,154,048
5Apr 1, 2023 19:114,2051,164,392,805606,854,00023,954,00017,166,336
6Apr 1, 2023 19:114,2051,160,937,445606,831,00023,993,00016,953,344
7Apr 1, 2023 19:114,2061,160,840,278602,880,00027,948,00016,957,440
8Apr 1, 2023 19:114,2061,153,356,920606,978,00023,959,00016,986,112
9Apr 1, 2023 19:114,2061,160,065,170604,006,00026,955,00017,149,952
10Apr 1, 2023 19:114,2091,155,318,551609,355,00021,976,00016,957,440
11Apr 1, 2023 19:114,2091,153,312,972605,436,00025,975,00016,961,536
12Apr 1, 2023 19:114,2231,157,495,887605,475,00027,975,00017,154,048