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 21:21izotoffizotoffScore: 24,665Success
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 21:2124,497225,986,845198,881,0001,998,0002,326,528
2Mar 23, 2026 21:2124,665240,684,910200,252,0002,002,0002,326,528
3Mar 23, 2026 21:2124,784226,450,191201,228,0002,002,0002,326,528