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 25, 2026 14:33olliecrowolliecrowScore: 15,365Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 14:3310,102111,307,91881,839,000998,0002,527,232
2Mar 25, 2026 14:3315,365153,192,108123,993,0001,999,0002,375,680
3Mar 25, 2026 14:3315,412153,423,682122,369,0004,012,0002,273,280