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 28, 2026 05:29Dominique GarmierDominique GarmierScore: 10,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 05:2910,945114,234,44487,757,0001,994,0002,416,640
2Mar 28, 2026 05:2910,970120,133,09387,958,0001,999,0002,371,584
3Mar 28, 2026 05:2911,030118,160,65288,438,0002,009,0002,502,656