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 03:17Josu San MartinJosu San MartinScore: 25,182Success
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 03:1724,797223,815,780202,334,0001,001,0002,363,392
2Feb 7, 2026 03:1725,182236,968,692205,499,000997,0002,293,760
3Feb 7, 2026 03:1725,213230,818,649204,747,0001,997,0002,293,760