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 06:06Dominique GarmierDominique GarmierScore: 10,337Success
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 06:0610,302114,381,15683,471,0001,005,0002,347,008
2Mar 24, 2026 06:0610,337112,238,07282,773,0001,994,0002,359,296
3Mar 24, 2026 06:0610,344110,628,79583,823,000997,0002,355,200