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 28, 2026 21:27Dominique GarmierDominique GarmierScore: 11,507Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 21:2711,506125,056,06093,348,0001,003,0002,371,584
2Mar 28, 2026 21:2711,507123,669,83193,351,0001,003,0002,445,312
3Mar 28, 2026 21:2711,677125,844,52193,757,0001,994,0002,322,432