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 22, 2026 23:57izotoffizotoffScore: 30,399Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 23:5929,863274,908,131241,879,0002,998,0002,441,216
2Mar 22, 2026 23:5930,239276,342,503244,961,0002,999,0002,293,760
3Mar 22, 2026 23:5730,336274,995,775244,762,0003,996,0002,330,624
4Mar 22, 2026 23:5730,399277,580,112247,270,0002,002,0002,326,528
5Mar 22, 2026 23:5730,761281,325,240249,235,0003,002,0002,424,832
6Mar 22, 2026 23:5932,525294,088,368265,707,000998,0002,424,832