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 24, 2026 19:17Dominique GarmierDominique GarmierScore: 10,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 19:1710,089107,819,99280,734,0001,993,0002,289,664
2Mar 24, 2026 19:1710,100107,201,85381,821,000997,0002,392,064
3Mar 24, 2026 19:1710,166115,306,98782,361,0001,004,0002,494,464