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 listJun 22, 2025 21:27Adam FolwarcznyAdam FolwarcznyScore: 58,211Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 21:2756,875498,959,655466,374,00002,404,352
2Jun 22, 2025 21:2758,211503,852,146476,334,0001,000,0002,396,160
3Jun 22, 2025 21:2760,291523,855,127493,389,0001,000,0002,277,376