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 listDec 26, 2025 03:43Josu San MartinJosu San MartinScore: 12,377Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2025 03:4312,322128,765,988100,042,0001,000,0002,314,240
2Dec 26, 2025 03:4312,328124,687,493100,092,0001,000,0002,322,432
3Dec 26, 2025 03:4312,372120,778,435100,445,0001,004,0002,277,376
4Dec 26, 2025 03:4312,376124,519,459101,480,00002,318,336
5Dec 26, 2025 03:4312,377123,473,175100,485,0001,004,0002,433,024
6Dec 26, 2025 03:4312,377134,084,775101,494,00002,322,432
7Dec 26, 2025 03:4312,385127,890,409101,560,00002,322,432
8Dec 26, 2025 03:4312,403130,907,32299,711,0001,994,0002,310,144
9Dec 26, 2025 03:4312,424128,772,119100,878,000998,0002,322,432