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 8, 2026 05:39olliecrowolliecrowScore: 8,411Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 8, 2026 05:393,47246,486,85025,421,0003,050,0002,482,176
2Apr 7, 2026 01:338,21591,331,22663,339,0004,021,0002,412,544
3Apr 7, 2026 01:338,23994,202,42363,530,0004,033,0002,539,520
4Apr 7, 2026 01:338,41194,176,99664,972,0003,998,0002,560,000
5Apr 8, 2026 05:3922,269214,116,809180,608,0001,995,0002,301,952
6Apr 8, 2026 05:3922,297208,269,844177,839,0004,995,0002,428,928