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 23:31Josu San MartinJosu San MartinScore: 11,350Success
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 23:313,51758,238,60725,859,0002,983,0002,371,584
2Feb 7, 2026 23:3111,350118,213,87792,074,0001,000,0002,289,664
3Feb 7, 2026 23:3111,649127,379,38294,513,0001,005,0002,428,928