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,530Success
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:3111,518123,030,35593,447,0001,004,0002,445,312
2Feb 7, 2026 23:3111,530120,863,58491,526,0003,017,0002,297,856
3Feb 7, 2026 23:3111,546122,399,50592,688,0001,993,0002,334,720