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 listApr 25, 2026 06:44limanjun99limanjun99Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 06:450363,780,858338,136,00010,004,0002,441,216expected "2237861058 ", got "Warning: the tight bound is too tight. Tight bound: [2233700369, 0], Median: 2237861058 "
2Apr 25, 2026 06:4544,696384,379,105358,521,0007,989,0002,502,656
3Apr 25, 2026 06:4545,888393,099,696368,278,0008,006,0002,527,232