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 listMar 21, 2026 12:59Dominique GarmierDominique GarmierScore: 13,272Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 12:5913,228140,602,877106,458,0002,008,0002,347,008
2Mar 21, 2026 12:5913,272135,161,973106,835,0001,996,0002,502,656
3Mar 21, 2026 12:5913,295136,538,716106,021,0003,000,0002,453,504