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 23, 2026 13:05Dominique GarmierDominique GarmierScore: 18,707Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 13:0518,667180,368,07365,029,00088,039,0002,301,952
2Mar 23, 2026 13:0518,707178,859,77664,168,00089,233,0002,297,856
3Mar 23, 2026 13:0518,734188,445,21362,845,00090,776,0002,281,472