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 29, 2026 00:16Dominique GarmierDominique GarmierScore: 42,083Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 00:1641,765368,782,969342,469,00002,310,144
2Mar 29, 2026 00:1642,083374,494,404342,080,0003,000,0002,527,232
3Mar 29, 2026 00:1643,166379,229,842350,965,0002,999,0002,531,328