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 8, 2026 09:11Victor MerckléVictor MerckléScore: 2,602Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 09:122,59629,730,36221,290,000024,576stderr
2Sep 8, 2026 09:122,59729,651,41421,302,000024,576stderr
3Sep 8, 2026 09:122,59829,665,47721,305,000024,576stderr
4Sep 8, 2026 09:122,60130,474,96021,330,000024,576stderr
5Sep 8, 2026 09:122,60229,721,95821,340,000024,576stderr
6Sep 8, 2026 09:122,60229,682,17321,342,000024,576stderr
7Sep 8, 2026 09:122,60330,519,37721,351,000024,576stderr
8Sep 8, 2026 09:122,61029,595,52321,409,000024,576stderr
9Sep 8, 2026 09:125,34152,221,68242,782,0001,015,00024,576stderr