How to get the index and max value of an array in one shot?

Generally, if you need an index, you’ll have to stream over the indices. Then, the task becomes straight-forward:

List<Integer> intArr = Arrays.asList(5, 8, 3, 2);
IntStream.range(0, intArr.size())
  .reduce((a,b)->intArr.get(a)<intArr.get(b)? b: a)
  .ifPresent(ix->System.out.println("Index "+ix+", value "+intArr.get(ix)));

a more elegant solution, which unfortunately incorporates boxing overhead is

IntStream.range(0, intArr.size())
  .boxed().max(Comparator.comparing(intArr::get))
  .ifPresent(ix->System.out.println("Index "+ix+", value "+intArr.get(ix)));

If you don't mind using third-party code, my StreamEx library provides some shortcuts for this task:

List<Integer> intArr = Arrays.asList(5, 8, 3, 2);
IntStreamEx.ofIndices(intArr)
           .maxBy(intArr::get)
           .ifPresent(ix->System.out.println("Index "+ix+", value "+intArr.get(ix)));

Internally it's close to the first solution provided by @Holger (no boxing).

In java8 you can execute streams in parallel

Integer[] intArr= {1,2,6,2,234,3,54,6,4564,456};

IntStream.range(0, intArr.length-1).parallel().
                reduce((a,b)->intArr[a]<intArr[b]? b: a).
                ifPresent(ix -> System.out.println("Index: " + ix + ", value: " + intArr[ix]));

I don't think there is currently any solution that's equally as fast as iterating manually:

int maxValueIndex = 0;
Integer maxValue = null;
for (int i = 0, n = intList.size(); i < n; ++i) {
    Integer value = intList.get(i);
    if (value == null || maxValue != null && value <= maxValue)
        continue;
    maxValue = value;
    maxValueIndex = i;
}