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 09:30Dominique GarmierDominique GarmierScore: 14,723Success
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 09:3012,336125,622,19498,150,0003,004,0002,334,720
2Mar 25, 2026 09:3014,723147,104,044117,733,0002,993,0002,351,104
3Mar 25, 2026 09:3014,862144,656,397117,874,0003,995,0002,301,952