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 28, 2025 19:50Adam FolwarcznyAdam FolwarcznyScore: 68,198Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2025 19:5060,460517,317,167471,783,00023,988,0002,420,736
2Jun 28, 2025 19:5068,198588,027,366542,217,00017,006,0002,437,120
3Jun 28, 2025 19:5069,053594,689,125544,229,00022,009,0002,420,736