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 10, 2026 22:45olliecrowolliecrowScore: 18,683Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 22:453,48657,127,85627,564,0001,020,0002,392,064
2Mar 10, 2026 22:4518,683180,924,699149,196,0004,005,0002,322,432
3Mar 10, 2026 22:4518,699178,366,185149,323,0004,008,0002,424,832