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:46Mehdi-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:470289,288,315268,862,0002,998,0002,514,944expected "2164917696 ", got "2164981760 "
2May 1, 2026 19:470292,169,758267,479,0002,003,0002,334,720expected "2177010246 ", got "2177040384 "
3May 1, 2026 19:470287,700,127260,327,0002,002,0002,523,136expected "2154823849 ", got "2154889216 "