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 12:12Dominique GarmierDominique GarmierScore: 36,338Success
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 12:1235,653318,198,165292,358,00002,502,656
2Mar 23, 2026 12:1236,338326,021,674295,975,0001,999,0002,318,336
3Mar 23, 2026 12:1237,362333,322,294304,364,0002,002,0002,318,336