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 09:59Aniruddha DebAniruddha DebScore: 5,834Success
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 09:595,67967,387,01746,566,00002,482,176
2Jul 6, 2025 09:595,72070,087,45745,910,000998,0002,490,368
3Jul 6, 2025 09:595,73074,414,96145,990,000999,0002,306,048
4Jul 6, 2025 09:595,83474,221,49846,839,000996,0002,277,376
5Jul 6, 2025 09:595,86869,658,41246,113,0002,004,0002,420,736
6Jul 6, 2025 09:595,89172,434,39348,304,00002,400,256