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 listDec 26, 2025 03:27Josu San MartinJosu San MartinScore: 19,144Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2025 03:2719,108187,353,351155,686,000997,0002,293,760
2Dec 26, 2025 03:2719,144185,650,618155,980,000999,0002,293,760
3Dec 26, 2025 03:2719,159178,131,747155,100,0002,001,0002,510,848