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 listJun 20, 2025 21:46Adam FolwarcznyAdam FolwarcznyScore: 118,975Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2025 21:4699,646843,504,410703,223,000113,874,0002,301,952
2Jun 20, 2025 21:46118,9751,001,853,664857,643,000117,950,0002,396,160
3Jun 20, 2025 21:46131,2011,099,847,102949,985,000125,865,0002,408,448