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 20:36Dominique GarmierDominique GarmierScore: 12,651Success
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 20:3612,623128,458,473100,497,0003,014,0002,437,120
2Mar 21, 2026 20:3612,651132,242,776102,741,000997,0002,396,160
3Mar 21, 2026 20:3612,707136,352,101101,246,0002,948,0002,449,408