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 listSep 19, 2026 18:23Andrew EpsteinAndrew EpsteinScore: 17,774Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 18:242,65631,182,58121,783,000020,480
2Sep 19, 2026 18:242,66830,701,78721,884,000020,480
3Sep 19, 2026 18:242,67031,122,57321,901,000020,480
4Sep 19, 2026 18:2417,693153,956,548145,087,000020,480
5Sep 19, 2026 18:2417,774154,593,724145,752,000020,480
6Sep 19, 2026 18:2417,783154,652,050145,824,000020,480
7Sep 19, 2026 18:2418,247158,541,816149,629,000020,480
8Sep 19, 2026 18:2418,378159,562,396150,704,000020,480
9Sep 19, 2026 18:2418,928164,056,998155,211,000020,480