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 22, 2026 07:32olliecrowolliecrowScore: 42,300Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 07:3412,377122,824,03099,483,0002,009,0002,359,296
2Apr 22, 2026 07:3412,538110,071,82998,824,0003,992,0002,506,752
3Apr 22, 2026 07:3442,081353,693,287341,065,0004,000,0002,424,832
4Apr 22, 2026 07:3442,272354,171,325340,644,0005,993,0002,494,464
5Apr 22, 2026 07:3442,300369,603,001342,866,0003,998,0002,383,872
6Apr 22, 2026 07:3442,322355,468,251342,030,0005,015,0002,580,480
7Apr 22, 2026 07:3442,359356,034,087341,359,0005,988,0002,420,736
8Apr 22, 2026 07:3442,478355,957,824344,321,0004,003,0002,379,776
9Apr 22, 2026 07:3442,560357,712,804346,000,0003,000,0002,437,120