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 22, 2026 08:41Dominique GarmierDominique GarmierScore: 118,188Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 08:41116,384977,853,469809,450,000144,901,0002,535,424
2Mar 22, 2026 08:41118,188997,620,549820,271,000148,867,0002,301,952
3Mar 22, 2026 08:41123,0431,030,517,613870,098,000138,856,0002,535,424