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 18:00Dominique GarmierDominique GarmierScore: 10,082Success
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 18:0010,055106,640,60479,474,0002,980,0002,351,104
2Mar 28, 2026 18:0010,082107,274,56380,683,0001,992,0002,502,656
3Mar 28, 2026 18:0010,115104,967,28980,947,0001,998,0002,273,280