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 27, 2026 13:17Dominique GarmierDominique GarmierScore: 131,753Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 13:17130,6061,093,003,3851,068,967,0001,999,0002,355,200
2Mar 27, 2026 13:17131,7531,106,716,3901,079,374,000999,0002,420,736
3Mar 27, 2026 13:17131,8121,106,260,2491,080,856,00002,396,160