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 listApr 25, 2026 08:09limanjun99limanjun99Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 08:09051,176,63630,641,0002,042,0002,330,624expected "2122274287 ", got "3657180442"
2Apr 25, 2026 08:09052,634,73630,857,0002,986,0002,400,256expected "2338184645 ", got "2610339815"
3Apr 25, 2026 08:09053,045,83931,533,0002,034,0002,334,720expected "2262915053 ", got "2260832286"