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 10:00Dominique GarmierDominique GarmierScore: 11,312Success
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 10:0011,263113,906,51590,348,0002,007,0002,293,760
2Mar 28, 2026 10:0011,312122,654,27391,758,000997,0002,371,584
3Mar 28, 2026 10:0011,312117,366,83591,761,000997,0002,461,696