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 2, 2026 05:33Rajarshi BasuRajarshi BasuScore: 99,724Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 05:349,759105,144,74864,019,00016,004,0002,482,176
2Jan 2, 2026 05:3310,145109,199,06774,165,0009,020,0002,408,448
3Jan 2, 2026 05:3410,561115,018,29670,677,00015,927,0002,318,336
4Jan 2, 2026 05:3399,724843,535,882690,781,000126,959,0002,342,912
5Jan 2, 2026 05:33109,392924,259,535781,142,000115,872,0002,428,928
6Jan 2, 2026 05:34109,853926,550,449765,972,000134,819,0002,494,464