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 listMar 21, 2023 04:08Yuriy LyfenkoYuriy LyfenkoScore: 4,474Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2023 04:084,299706,174,297644,871,943016,949,248
2Mar 21, 2023 04:084,306719,278,274645,936,177016,953,344
3Mar 21, 2023 04:084,328735,161,432649,162,276016,949,248
4Mar 21, 2023 04:084,364678,545,439630,635,00023,986,00017,129,472
5Mar 21, 2023 04:084,373681,920,363631,026,00024,961,00017,199,104
6Mar 21, 2023 04:084,405687,420,122638,810,00021,959,00017,039,360
7Mar 21, 2023 04:084,474699,200,133647,071,00023,965,00016,965,632
8Mar 21, 2023 04:084,509698,202,652653,420,00022,979,00016,941,056
9Mar 21, 2023 04:084,514701,027,359652,077,00024,964,00017,088,512
10Mar 21, 2023 04:084,540715,986,053656,077,00024,964,00016,986,112
11Mar 21, 2023 04:084,587712,299,718666,086,00021,969,00016,957,440
12Mar 21, 2023 04:084,695727,861,597678,334,00025,974,00016,969,728