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 31, 2025 08:20Rajarshi BasuRajarshi BasuScore: 10,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 08:2010,798109,187,09586,556,0001,989,0002,514,944
2Dec 31, 2025 08:2010,830114,018,78085,817,0002,993,0002,510,848
3Dec 31, 2025 08:2010,901114,392,80786,377,0003,013,0002,322,432