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 listNov 1, 2025 09:35AntonAntonScore: 91,745Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2025 09:3586,156729,206,394533,608,000172,873,0002,379,776
2Nov 1, 2025 09:3591,745780,449,134578,472,000173,841,0002,338,816
3Nov 1, 2025 09:35110,692936,355,509730,933,000176,742,0002,285,568