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 listJul 6, 2025 08:16Aniruddha DebAniruddha DebScore: 6,838Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2025 08:166,66779,577,79053,654,0001,012,0002,351,104
2Jul 6, 2025 08:166,69784,650,56652,917,0001,996,0002,375,680
3Jul 6, 2025 08:166,75876,030,80054,409,0001,007,0002,326,528
4Jul 6, 2025 08:166,82581,955,90052,968,0002,998,0002,502,656
5Jul 6, 2025 08:166,83881,397,47553,066,0003,003,0002,465,792
6Jul 6, 2025 08:166,90286,701,41354,577,0002,021,0002,314,240
7Jul 6, 2025 08:166,95985,628,96356,059,0001,001,0002,351,104
8Jul 6, 2025 08:167,31082,400,21556,948,0002,997,0002,347,008
9Jul 6, 2025 08:167,41887,180,58658,834,0001,994,0002,449,408