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 04:32Yuriy LyfenkoYuriy LyfenkoScore: 4,301Success
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 04:324,242700,928,922636,257,238016,936,960
2Apr 1, 2023 04:324,251728,056,298637,625,925016,945,152
3Apr 1, 2023 04:324,272716,240,720640,838,160016,936,960
4Apr 1, 2023 04:324,294668,322,880619,111,00024,964,00016,969,728
5Apr 1, 2023 04:324,294677,396,902618,163,00025,964,00017,002,496
6Apr 1, 2023 04:324,298671,233,001618,670,00025,986,00016,982,016
7Apr 1, 2023 04:324,301672,467,898620,215,00024,968,00017,113,088
8Apr 1, 2023 04:324,324677,468,732620,657,00027,984,00016,982,016
9Apr 1, 2023 04:324,327682,596,443626,015,00022,963,00017,006,592
10Apr 1, 2023 04:324,330671,953,680627,450,00021,980,00017,043,456
11Apr 1, 2023 04:324,334678,780,429622,163,00027,962,00017,190,912
12Apr 1, 2023 04:324,359682,327,248627,919,00025,955,00016,957,440