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 25, 2026 03:07Dominique GarmierDominique GarmierScore: 10,092Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 03:0710,090112,764,98981,745,000996,0002,453,504
2Mar 25, 2026 03:0710,092112,863,02480,764,0001,994,0002,482,176
3Mar 25, 2026 03:0710,137109,941,66781,121,0002,002,0002,412,544