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 19, 2026 03:37Dominique GarmierDominique GarmierScore: 13,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 03:3713,148132,589,261105,815,0001,996,0002,310,144
2Mar 19, 2026 03:3713,170131,459,917106,993,000999,0002,355,200
3Mar 19, 2026 03:3713,190136,849,360106,158,0002,002,0002,285,568