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 12, 2026 16:19Josu San MartinJosu San MartinScore: 4,530Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 16:194,52462,269,11734,089,0003,007,0002,469,888
2Mar 12, 2026 16:194,53065,296,78836,139,0001,003,0002,383,872
3Mar 12, 2026 16:195,049117,303,20238,517,0002,888,0002,277,376