Chapel's standard library sort runs an order of magnitude faster than that of the next fastest language.
Chapel solutions to Poisson's equation outperform C++ solutions while requiring less code overall.
Chapel can process massive amounts of data, all on a single multi-core machine.
Sum an array or check for an element in a single parallel expression. Reductions are natively supported and automatically parallelized.
Scalar operations promote to accept array arguments and process in parallel.
Use every core with built-in support for parallel file IO.
