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 05:15Josu San MartinJosu San MartinScore: 11,204Success
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 05:1511,185117,663,22790,724,000996,0002,416,640
2Feb 7, 2026 05:1511,204119,129,64090,878,000998,0002,383,872
3Feb 7, 2026 05:1511,327119,270,46291,881,000998,0002,408,448