Median Sergey Svistunov

Find the median of a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listSep 7, 2026 16:37Victor MerckléVictor MerckléScore: 2,606Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 16:392,59429,669,70321,277,000024,576stderr
2Sep 7, 2026 16:392,59529,670,88621,281,000024,576stderr
3Sep 7, 2026 16:392,59829,926,95721,306,000024,576stderr
4Sep 7, 2026 16:392,60130,455,97821,330,000024,576stderr
5Sep 7, 2026 16:392,60629,792,23721,372,000024,576stderr
6Sep 7, 2026 16:392,60730,406,93621,385,000024,576stderr
7Sep 7, 2026 16:392,61929,858,99620,473,0001,010,00024,576stderr
8Sep 7, 2026 16:395,27952,368,70342,280,0001,015,00028,672stderr
9Sep 7, 2026 16:395,28151,764,68942,298,0001,012,00024,576stderr