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 listApr 25, 2026 07:53limanjun99limanjun99Error
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 30, 2026 22:20Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 30, 2026 22:21013,036,78501,721,00020,480No answer to stdout. Died or killed?
2Apr 25, 2026 07:544,09548,328,30531,551,0002,035,0002,502,656
3Apr 25, 2026 07:544,10052,510,96031,586,0002,037,0002,519,040
4Apr 25, 2026 07:544,11849,083,10331,727,0002,046,0002,531,328
5Apr 25, 2026 07:544,15355,978,51731,056,0003,005,0002,519,040
6Apr 25, 2026 07:544,15651,820,27030,072,0004,009,0002,527,232
7Apr 25, 2026 07:544,16752,889,33731,157,0003,015,0002,519,040
8Apr 25, 2026 07:544,16851,445,80931,169,0003,016,0002,387,968
9Apr 25, 2026 07:544,17550,871,83931,221,0003,021,0002,502,656
10Apr 25, 2026 07:544,19953,813,41732,413,0002,025,0002,506,752