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 19, 2026 14:37Dominique GarmierDominique GarmierScore: 23,109Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 14:3722,533216,584,250182,772,0001,997,0002,351,104
2Mar 19, 2026 14:3723,109216,560,466188,492,0001,002,0002,351,104
3Mar 19, 2026 14:3723,508224,165,788192,763,00002,355,200