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 24, 2026 14:13Dominique GarmierDominique GarmierScore: 21,761Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 14:135,03068,251,60240,238,0001,005,0002,510,848
2Mar 24, 2026 14:1321,761209,808,768177,438,0001,002,0002,396,160
3Mar 24, 2026 14:1321,997205,451,031178,370,0002,004,0002,437,120