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 17:12olliecrowolliecrowScore: 12,164Success
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 22:3112,130125,807,80798,465,0001,004,0002,416,640
2Mar 4, 2026 17:1212,135128,184,78896,496,0003,015,0002,527,232
3Mar 4, 2026 22:3112,138133,483,83498,529,0001,005,0002,416,640
4Mar 4, 2026 22:3112,138130,247,25796,519,0003,016,0002,420,736
5Mar 4, 2026 22:3112,143128,509,87597,560,0002,011,0002,412,544
6Mar 4, 2026 22:3112,155126,092,37096,685,0002,990,0002,420,736
7Mar 4, 2026 17:1212,164128,232,75296,753,0002,992,0002,404,352
8Mar 4, 2026 22:3112,165130,237,25096,761,0002,992,0002,424,832
9Mar 4, 2026 17:1212,167131,987,02296,778,0002,993,0002,416,640
10Mar 4, 2026 22:3112,168127,001,48897,780,0001,995,0002,416,640
11Mar 4, 2026 22:3112,222131,774,24398,213,0002,004,0002,433,024
12Mar 4, 2026 22:3112,236134,358,79799,335,0001,003,0002,433,024