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 listMay 1, 2026 15:07Mehdi-Dehghan-FooladiMehdi-Dehghan-FooladiScore: 900,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 15:08855,2117,033,718,3256,869,823,000142,913,0002,318,336
2May 1, 2026 15:08900,7627,405,868,5867,246,342,000139,910,0002,449,408
3May 1, 2026 15:08927,3957,628,792,7127,452,754,000151,893,0002,551,808