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 listSep 19, 2026 17:31Andrew EpsteinAndrew EpsteinScore: 17,719Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 17:322,72131,139,34321,249,0001,067,00020,480
2Sep 19, 2026 17:322,72431,046,60821,293,0001,046,00020,480
3Sep 19, 2026 17:322,73231,798,85721,341,0001,065,00020,480
4Sep 19, 2026 17:3217,240150,184,113140,336,0001,038,00020,480
5Sep 19, 2026 17:3217,719154,120,408144,278,0001,022,00020,480
6Sep 19, 2026 17:3218,293158,776,098148,949,0001,057,00020,480
7Sep 19, 2026 17:3218,326159,177,001149,242,0001,039,00020,480
8Sep 19, 2026 17:3218,340159,206,853149,383,0001,013,00020,480
9Sep 19, 2026 17:3218,621162,014,079151,598,0001,097,00020,480