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 14, 2026 03:53Yuriy LyfenkoYuriy LyfenkoScore: 4,288Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2026 03:534,28568,537,51431,123,0004,015,0002,523,136
2Apr 14, 2026 03:534,28858,715,14631,140,0004,018,0002,420,736
3Apr 14, 2026 03:534,36760,855,45831,833,0003,979,0002,375,680