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 11:24Dominique GarmierDominique GarmierScore: 36,790Success
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 11:2436,571326,819,550297,885,0001,999,0002,387,968
2Mar 23, 2026 11:2436,790329,833,863299,680,0001,997,0002,387,968
3Mar 23, 2026 11:2437,123329,386,789303,409,0001,001,0002,273,280