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 listFeb 7, 2026 02:26Josu San MartinJosu San MartinScore: 24,760Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 02:2624,112226,717,527196,717,000998,0002,355,200
2Feb 7, 2026 02:2624,760224,317,171202,031,0001,000,0002,293,760
3Feb 7, 2026 02:2625,606233,237,194207,970,0001,999,0002,347,008