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 listJan 8, 2026 07:04Rajarshi BasuRajarshi BasuScore: 73,734Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 07:035,41872,517,25739,377,0005,048,0002,392,064
2Jan 8, 2026 07:0473,081637,507,990481,408,000117,855,0002,355,200
3Jan 8, 2026 07:0373,492627,513,327484,706,000117,928,0002,351,104
4Jan 8, 2026 07:0473,734632,986,016486,693,000117,925,0002,285,568
5Jan 8, 2026 07:0479,464688,286,714539,672,000111,932,0002,514,944
6Jan 8, 2026 07:03105,368891,227,173759,139,000104,881,0002,285,568