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 23, 2026 00:17Dominique GarmierDominique GarmierScore: 25,818Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 00:1725,814237,490,127208,683,0002,995,0002,338,816
2Mar 23, 2026 00:1725,818238,226,182210,706,000998,0002,437,120
3Mar 23, 2026 00:1725,818246,312,684210,711,000998,0002,322,432