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 06:58olliecrowolliecrowScore: 12,159Success
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 06:5812,126126,193,16797,423,0002,008,0002,424,832
2Mar 4, 2026 06:5812,136127,926,12098,510,0001,005,0002,453,504
3Mar 4, 2026 06:5812,137123,551,54498,516,0001,005,0002,457,600
4Mar 4, 2026 06:5812,142125,413,63498,559,0001,005,0002,420,736
5Mar 4, 2026 06:5812,159127,211,05097,706,0001,994,0002,408,448
6Mar 4, 2026 06:5812,161126,361,06395,734,0003,988,0002,453,504
7Mar 4, 2026 06:5812,164125,653,74897,749,0001,994,0002,433,024
8Mar 4, 2026 06:5812,168126,835,63496,751,0003,023,0002,404,352
9Mar 4, 2026 06:5812,190128,066,63697,956,0001,999,0002,412,544