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 3, 2026 22:13Josu San MartinJosu San MartinScore: 15,397Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 22:1415,335135,848,456124,737,0001,012,0002,121,728stderr
2Sep 3, 2026 22:1415,365135,941,590124,988,0001,009,0002,121,728stderr
3Sep 3, 2026 22:1415,382136,865,901125,127,0001,010,0002,121,728stderr
4Sep 3, 2026 22:1415,393136,136,357125,213,0001,010,0002,121,728stderr
5Sep 3, 2026 22:1415,397136,148,359125,243,0001,015,0002,121,728stderr
6Sep 3, 2026 22:1415,413137,208,945125,382,0001,007,0002,121,728stderr
7Sep 3, 2026 22:1415,426136,505,455125,482,0001,016,0002,121,728stderr
8Sep 3, 2026 22:1415,439136,536,321125,587,0001,019,0002,121,728stderr
9Sep 3, 2026 22:1415,542137,512,414126,418,0001,033,0002,121,728stderr