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 17, 2026 17:38T PrathamT PrathamScore: 28,579Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 17:3827,536257,120,635223,795,0001,998,0002,285,568
2Mar 17, 2026 17:3827,786252,547,254225,844,0001,998,0002,277,376
3Mar 17, 2026 17:3828,461254,557,230233,383,00002,285,568
4Mar 17, 2026 17:3828,536260,074,876230,994,0002,999,0002,260,992
5Mar 17, 2026 17:3828,579263,220,375233,346,0001,001,0002,277,376
6Mar 17, 2026 17:3828,679267,305,126233,166,0002,001,0002,277,376
7Mar 17, 2026 17:3829,110268,308,076237,707,000998,0002,285,568
8Mar 17, 2026 17:3829,265272,905,003237,971,0001,999,0002,387,968
9Mar 17, 2026 17:3829,434265,155,698240,359,0001,001,0002,265,088