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 listApr 20, 2026 15:52BenBenScore: 43,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 15:5543,109380,368,146186,736,000166,764,0002,392,064
2Apr 20, 2026 15:5543,138373,580,286181,865,000171,873,0002,260,992
3Apr 20, 2026 15:5543,856389,523,996179,813,000179,813,0002,342,912