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:05Yuriy LyfenkoYuriy LyfenkoScore: 4,404Success
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:054,323674,172,991622,494,00025,978,00017,166,336
2Mar 21, 2023 04:054,362679,253,862628,322,00025,971,00017,039,360
3Mar 21, 2023 04:054,368682,747,732633,278,00021,974,00017,129,472
4Mar 21, 2023 04:054,380688,969,294628,952,00027,997,00017,018,880
5Mar 21, 2023 04:054,383681,733,862631,491,00025,979,00017,199,104
6Mar 21, 2023 04:054,389683,124,071630,443,00027,975,00017,018,880
7Mar 21, 2023 04:054,404685,340,233634,580,00025,982,00017,125,376
8Mar 21, 2023 04:054,414689,583,147632,177,00029,961,00017,145,856
9Mar 21, 2023 04:054,438691,956,142639,657,00025,986,00016,969,728
10Mar 21, 2023 04:054,445737,810,070666,779,703016,949,248
11Mar 21, 2023 04:054,477728,621,578671,481,791016,941,056
12Mar 21, 2023 04:054,503727,751,973675,413,808016,949,248