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 18, 2026 04:36limanjun99limanjun99Score: 91,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 04:3687,015743,351,743587,609,000125,916,0002,285,568
2Mar 18, 2026 04:3691,702784,835,679615,147,000136,810,0002,277,376
3Mar 18, 2026 04:36110,644934,285,217791,372,000115,908,0002,408,448