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 23, 2026 04:01Charles CabergsCharles CabergsScore: 5,538Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 04:075,47964,727,41940,938,0003,993,0002,408,448
2Apr 23, 2026 04:075,47961,072,76141,935,0002,995,0002,363,392
3Apr 23, 2026 04:075,52856,842,73241,305,0004,029,0002,334,720
4Apr 23, 2026 04:075,53367,712,64443,359,0002,016,0002,392,064
5Apr 23, 2026 04:075,53861,964,15141,376,0004,036,0002,297,856
6Apr 23, 2026 04:075,55759,389,24143,545,0002,025,0002,306,048
7Apr 23, 2026 04:075,55963,809,56442,549,0003,039,0002,347,008
8Apr 23, 2026 04:075,57866,913,16840,772,0004,972,0002,355,200
9Apr 23, 2026 04:075,58462,397,85042,807,0002,986,0002,555,904