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 26, 2026 23:03Dominique GarmierDominique GarmierScore: 213,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 23:03213,0791,778,027,4031,745,245,0001,999,0002,396,160
2Mar 26, 2026 23:03213,3641,771,517,7471,749,586,00002,519,040
3Mar 26, 2026 23:03213,5101,778,829,9831,748,783,0001,998,0002,342,912