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 30, 2026 12:55Dominique GarmierDominique GarmierScore: 13,144Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 12:5513,085136,414,923106,294,0001,002,0002,351,104
2Mar 30, 2026 12:5513,144138,348,208105,787,0001,995,0002,293,760
3Mar 30, 2026 12:5513,254132,342,881106,686,0001,994,0002,301,952