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 listApr 15, 2026 02:01zielajzielajScore: 5,367Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2026 02:012,79947,137,36019,959,0002,993,0002,330,624
2Apr 15, 2026 02:015,36764,387,85243,011,0001,000,0002,285,568
3Apr 15, 2026 02:015,38369,331,78942,134,0002,006,0002,424,832