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 listMar 27, 2026 14:31Dominique GarmierDominique GarmierScore: 12,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 14:3112,203120,483,65597,061,0003,001,0002,301,952
2Mar 27, 2026 14:3112,292119,165,60097,800,0002,993,0002,486,272
3Mar 27, 2026 14:3112,310119,208,62297,947,0002,998,0002,379,776