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:23Yuriy LyfenkoYuriy LyfenkoScore: 4,193Success
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:234,156677,549,329623,459,886016,953,344
2Apr 1, 2023 19:234,161692,497,928624,215,096016,945,152
3Apr 1, 2023 19:234,163693,562,346624,392,009016,949,248
4Apr 1, 2023 19:234,183650,502,094598,521,00028,976,00017,186,816
5Apr 1, 2023 19:234,184650,573,109601,602,00025,982,00017,080,320
6Apr 1, 2023 19:234,192657,533,956604,863,00023,954,00017,051,648
7Apr 1, 2023 19:234,193659,665,358603,024,00025,957,00016,957,440
8Apr 1, 2023 19:234,196655,249,056603,493,00025,978,00016,957,440
9Apr 1, 2023 19:234,212661,445,963606,757,00024,989,00016,957,440
10Apr 1, 2023 19:234,212656,559,674608,779,00022,991,00016,969,728
11Apr 1, 2023 19:234,212664,165,213606,918,00024,955,00017,104,896
12Apr 1, 2023 19:234,224660,773,798609,558,00023,982,00017,190,912