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 01:57Josu San MartinJosu San MartinScore: 8,115Success
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 01:578,11589,588,73365,538,0001,008,0002,326,528
2Feb 7, 2026 01:578,11591,410,33765,539,0001,008,0002,367,488
3Feb 7, 2026 01:578,14591,637,12565,792,000996,0002,494,464