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 16:49Dominique GarmierDominique GarmierScore: 168,152Success
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 16:49166,0601,387,467,8981,360,690,000999,0002,449,408
2Mar 27, 2026 16:49168,1521,405,620,2831,375,848,0002,997,0002,519,040
3Mar 27, 2026 16:49168,1851,403,790,5351,376,115,0002,998,0002,318,336