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 16, 2026 11:39Dominique GarmierDominique GarmierScore: 56,069Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 11:3955,930485,286,995456,627,0001,998,0002,289,664
2Mar 16, 2026 11:3956,069486,353,272457,770,0001,998,0002,506,752
3Mar 16, 2026 11:3957,675501,522,304470,940,0001,999,0002,498,560