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 20, 2026 14:58olliecrowolliecrowScore: 3,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 14:583,28955,848,63024,972,0001,997,0002,404,352
2Mar 20, 2026 14:583,29253,326,08324,992,0001,999,0002,519,040
3Mar 20, 2026 14:5821,325199,538,145171,870,0002,997,0002,371,584