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 08:44Dominique GarmierDominique GarmierScore: 14,122Success
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 08:4414,120139,637,826114,788,000998,0002,306,048
2Mar 25, 2026 08:4414,122143,415,967114,799,000998,0002,473,984
3Mar 25, 2026 08:4414,236143,850,840114,744,0001,995,0002,412,544