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 19:45Dominique GarmierDominique GarmierScore: 9,543Success
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 19:459,492105,926,94974,842,0002,993,0002,285,568
2Mar 23, 2026 19:459,543105,975,38174,243,0004,013,0002,449,408
3Mar 23, 2026 19:459,56199,637,03876,393,0002,010,0002,437,120