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 listMay 1, 2026 14:32Pavel SkripkinPavel SkripkinScore: 39,507Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 14:3338,644333,711,151178,933,000137,948,0002,342,912
2May 1, 2026 14:3339,004338,368,872181,908,000137,930,0002,342,912
3May 1, 2026 14:3339,231337,814,503183,828,000137,871,0002,412,544
4May 1, 2026 14:3339,423342,541,133182,720,000140,553,0002,342,912
5May 1, 2026 14:3339,507342,857,482186,976,000136,982,0002,334,720
6May 1, 2026 14:3339,535344,439,973184,540,000139,652,0002,342,912
7May 1, 2026 14:3339,636345,032,717185,010,000140,007,0002,338,816
8May 1, 2026 14:3339,746345,005,103180,955,000144,963,0002,400,256
9May 1, 2026 14:3340,028344,044,680182,129,000146,103,0002,482,176