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 listAug 18, 2026 09:00Josu San MartinJosu San MartinScore: 3,853Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 09:033,78441,211,28228,968,0002,064,0002,113,536
2Aug 18, 2026 09:033,82341,410,05629,193,0002,157,0002,113,536
3Aug 18, 2026 09:033,83241,425,99429,410,0002,019,0002,113,536
4Aug 18, 2026 09:033,83441,551,19929,271,0002,175,0002,113,536
5Aug 18, 2026 09:033,85342,364,54429,432,0002,167,0002,113,536
6Aug 18, 2026 09:033,85843,704,15029,451,0002,190,0002,113,536
7Aug 18, 2026 09:033,86241,621,15629,521,0002,153,0002,113,536
8Aug 18, 2026 09:033,88941,881,74629,853,0002,044,0002,113,536
9Aug 18, 2026 09:033,92342,296,40530,144,0002,032,0002,113,536