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 listMar 4, 2026 05:12olliecrowolliecrowScore: 12,173Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 05:1212,142125,863,87398,562,0001,005,0002,424,832
2Mar 4, 2026 05:1212,162130,611,63597,734,0001,994,0002,428,928
3Mar 4, 2026 05:1212,163123,454,92597,739,0001,994,0002,396,160
4Mar 4, 2026 05:1212,168125,617,40999,774,00002,400,256
5Mar 4, 2026 05:1212,173128,513,83097,820,0001,996,0002,428,928
6Mar 4, 2026 05:1212,178126,442,73498,859,000998,0002,424,832
7Mar 4, 2026 05:1212,181133,318,82897,887,0001,997,0002,461,696
8Mar 4, 2026 05:1212,181126,941,59794,893,0004,994,0002,461,696
9Mar 4, 2026 05:1212,197126,342,01297,019,0003,000,0002,433,024