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:52Rajarshi BasuRajarshi BasuScore: 29,064Success
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:5228,985259,818,214237,680,00002,379,776
2Dec 31, 2025 08:5229,064268,644,768236,326,0002,002,0002,297,856
3Dec 31, 2025 08:5229,104271,027,865236,657,0001,997,0002,297,856