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 listMay 1, 2026 16:58Pavel SkripkinPavel SkripkinScore: 12,367Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 16:5812,327118,479,60599,085,0002,001,0002,412,544
2May 1, 2026 16:5812,350119,635,95799,269,0002,005,0002,396,160
3May 1, 2026 16:5812,363119,353,109100,374,0001,003,0002,326,528
4May 1, 2026 16:5812,366119,717,913100,403,0001,004,0002,392,064
5May 1, 2026 16:5812,367118,758,422100,401,0001,014,0002,396,160
6May 1, 2026 16:5812,406118,752,74499,740,0001,994,0002,412,544
7May 1, 2026 16:5812,427119,902,729100,905,000999,0002,387,968
8May 1, 2026 16:5812,433119,912,35398,958,0002,998,0002,318,336
9May 1, 2026 16:5812,447116,096,660100,068,0002,001,0002,326,528