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 27, 2026 13:40Dominique GarmierDominique GarmierScore: 10,167Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 13:4010,094106,532,65980,774,0001,994,0002,359,296
2Mar 27, 2026 13:4010,167105,867,87281,358,0002,008,0002,342,912
3Mar 27, 2026 13:4010,177107,547,51982,445,0001,005,0002,375,680