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:20Andrew EpsteinAndrew EpsteinScore: 33,997Success
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:2118,905165,402,339154,022,0001,007,0002,117,632stderr
2Sep 19, 2026 18:2118,906165,402,830153,968,0001,069,0002,117,632stderr
3Sep 19, 2026 18:2133,814287,775,479275,222,0002,058,0002,117,632stderr
4Sep 19, 2026 18:2133,993289,286,112277,745,0001,004,0002,117,632stderr
5Sep 19, 2026 18:2133,997289,883,725277,775,0001,005,0002,117,632stderr
6Sep 19, 2026 18:2134,024289,502,251277,998,0001,004,0002,117,632stderr
7Sep 19, 2026 18:2134,144291,161,918278,983,0001,003,0002,117,632stderr
8Sep 19, 2026 18:2134,607294,177,384282,774,0001,004,0002,117,632stderr
9Sep 19, 2026 18:2134,612294,466,418282,818,0001,003,0002,117,632stderr