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 30, 2026 01:54Dominique GarmierDominique GarmierScore: 12,930Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 01:5412,928138,284,105105,008,0001,000,0002,396,160
2Mar 30, 2026 01:5412,930133,622,148103,027,0003,000,0002,379,776
3Mar 30, 2026 01:5412,933130,565,875105,048,0001,000,0002,375,680