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 27, 2026 13:16Dominique GarmierDominique GarmierScore: 165,714Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 13:16165,4211,380,873,6991,355,453,000999,0002,482,176
2Mar 27, 2026 13:16165,7141,385,244,2501,357,857,000999,0002,527,232
3Mar 27, 2026 13:16167,7301,405,960,6681,374,391,000999,0002,379,776