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 19:44Mehdi-Dehghan-FooladiMehdi-Dehghan-FooladiError
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 19:440285,124,664262,698,0002,996,0002,519,040expected "2078087864 ", got "2078146560 "
2May 1, 2026 19:440277,120,514256,925,0002,999,0002,523,136expected "2027552085 ", got "2027552768 "
3May 1, 2026 19:440277,334,151261,386,0002,002,0002,535,424expected "2055805453 ", got "2055864320 "