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 listMay 1, 2026 17:39Pavel SkripkinPavel SkripkinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 17:390121,692,842100,676,0003,987,0002,424,832expected "2181444103 ", got "2181443351 "
2May 1, 2026 17:390120,420,930101,094,0004,003,0002,449,408expected "2373748072 ", got "2373747859 "
3May 1, 2026 17:390121,358,217102,833,0001,996,0002,502,656expected "2142128567 ", got "2142135147 "