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 listJul 6, 2025 08:09Aniruddha DebAniruddha DebScore: 8,125Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2025 08:097,56689,544,98059,038,0003,001,0002,490,368
2Jul 6, 2025 08:097,77990,766,15962,789,000996,0002,527,232
3Jul 6, 2025 08:097,85886,985,37263,432,0001,006,0002,420,736
4Jul 6, 2025 08:097,90495,491,26062,820,0001,994,0002,441,216
5Jul 6, 2025 08:098,12596,408,09663,595,0003,028,0002,293,760
6Jul 6, 2025 08:098,13888,735,26464,742,0001,992,0002,433,024
7Jul 6, 2025 08:098,21685,996,50867,374,00002,330,624
8Jul 6, 2025 08:098,51295,810,85966,807,0002,991,0002,301,952
9Jul 6, 2025 08:098,84996,602,61572,565,00002,453,504