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 24, 2026 07:28Dominique GarmierDominique GarmierScore: 10,483Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 07:2810,474117,978,86383,887,0001,997,0002,420,736
2Mar 24, 2026 07:2810,483111,078,84384,959,000999,0002,387,968
3Mar 24, 2026 07:2810,501112,774,11485,105,0001,001,0002,461,696