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 18, 2026 06:06Charles CabergsCharles CabergsScore: 13,749Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 06:0613,734148,469,477109,631,0002,989,0002,351,104
2Apr 18, 2026 06:0613,749146,784,706109,749,0002,993,0002,338,816
3Apr 18, 2026 06:0613,810141,247,791111,237,0002,004,0002,347,008