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 24, 2026 22:49Dominique GarmierDominique GarmierScore: 438,849Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 22:49437,5613,616,158,4293,584,999,0002,998,0002,461,696
2Mar 24, 2026 22:49438,8493,625,297,1023,590,565,0007,996,0002,281,472
3Mar 24, 2026 22:49543,3334,481,344,2414,451,335,0003,997,0002,285,568