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 21, 2026 14:33Dominique GarmierDominique GarmierScore: 116,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 14:33116,543979,355,676953,655,0001,999,0002,396,160
2Mar 21, 2026 14:33116,624983,119,462955,314,000999,0002,334,720
3Mar 21, 2026 14:33116,709989,635,268957,016,00002,416,640