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 05:17Dominique GarmierDominique GarmierScore: 40,120Success
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 05:1738,990351,587,779319,721,00002,379,776
2Mar 23, 2026 05:1740,120355,550,308327,983,000999,0002,273,280
3Mar 23, 2026 05:1740,857354,819,721333,024,0002,000,0002,387,968