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 28, 2026 21:22Dominique GarmierDominique GarmierScore: 7,345Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 21:227,26685,896,27857,559,0002,019,0002,306,048
2Mar 28, 2026 21:227,34583,557,81858,225,0002,007,0002,486,272
3Mar 28, 2026 21:2210,321116,355,35682,617,0002,015,0002,416,640