You need to log in to make submissions.
Please read the general instructions for this exercise first. Here are the additional instructions specific to this task:
Implement a simple sequential baseline solution. Do not try to use any form of parallelism yet; try to make it work correctly first.
I will first run all kinds of tests to see that your code works correctly. You can try it out locally by running ./grading test, but please note that your code has to compile and work correctly not only on your own computer but also on our machines.
If all is fine, I will run the benchmarks. You can try it out on your own computer by running ./grading benchmark, but of course the precise running time on your own computer might be different from the performance on our grading hardware.
| Name | Parameters |
|---|---|
| benchmarks/1a | k = 1000, m = 1000, n = 1000 |
| multiply a 1000 × 1000 matrix with a 1000 × 1000 matrix for a 1000 × 1000 result. | |
| benchmarks/1b | k = 1003, m = 999, n = 1001 |
| multiply a 999 × 1003 matrix with a 1003 × 1001 matrix for a 999 × 1001 result. | |
| benchmarks/2 | k = 2000, m = 2000, n = 2000 |
| multiply a 2000 × 2000 matrix with a 2000 × 2000 matrix for a 2000 × 2000 result. | |
In this task your submission will be graded using benchmarks/2: multiply a 2000 × 2000 matrix with a 2000 × 2000 matrix for a 2000 × 2000 result..
The point thresholds are as follows. If you submit your solution no later than on Wednesday, 08 October 2025, at 23:59:59 (Helsinki), your score will be:
| Running time | Points |
|---|---|
| ≤ 6.000 sec | 1 |
| ≤ 3.000 sec | 2 |
| ≤ 1.000 sec | 3 |
If you submit your solution after the deadline, but before the course ends on Wednesday, 31 December 2025, at 23:59:59 (Helsinki), your score will be:
| Running time | Points |
|---|---|
| ≤ 6.000 sec | 1 |
| ≤ 3.000 sec | 2 |
| ≤ 1.000 sec | 3 |