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 listDec 26, 2025 03:34Josu San MartinJosu San MartinScore: 18,687Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2025 03:3118,633181,986,350150,792,0001,997,0002,330,624
2Dec 26, 2025 03:3418,664181,850,141152,048,0001,000,0002,277,376
3Dec 26, 2025 03:3118,682177,819,010153,193,00002,277,376
4Dec 26, 2025 03:3418,687171,484,284152,231,0001,001,0002,277,376
5Dec 26, 2025 03:3118,707179,577,331152,392,0001,002,0002,277,376
6Dec 26, 2025 03:3418,737180,249,196151,650,0001,995,0002,342,912