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 19, 2026 14:37Dominique GarmierDominique GarmierScore: 13,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 14:3713,141143,753,579104,760,0002,993,0002,318,336
2Mar 19, 2026 14:3713,143132,527,609106,772,000997,0002,293,760
3Mar 19, 2026 14:3713,186138,346,096106,123,0002,002,0002,297,856