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 16:42Mehdi-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 16:430278,556,094258,707,0002,996,0002,519,040expected "2035716574 ", got "1506 "
2May 1, 2026 16:430284,726,611265,713,0002,996,0002,523,136expected "2127781961 ", got "1485 "
3May 1, 2026 16:430278,753,046258,761,0002,997,0002,519,040expected "2014975831 ", got "1566 "