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 23, 2026 07:07Dominique GarmierDominique GarmierScore: 12,404Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 07:0712,285131,589,19898,744,0001,994,0002,510,848
2Mar 23, 2026 07:0712,404124,565,44896,726,0004,985,0002,523,136
3Mar 23, 2026 07:0712,471126,115,250100,256,0002,005,0002,490,368