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 21, 2026 07:17olliecrowolliecrowScore: 3,406Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 07:183,38352,605,62024,772,0002,972,0002,498,560
2Apr 21, 2026 07:183,39453,657,05024,851,0002,982,0002,420,736
3Apr 21, 2026 07:183,39655,574,55625,865,0001,989,0002,461,696
4Apr 21, 2026 07:183,40258,682,22624,910,0002,989,0002,342,912
5Apr 21, 2026 07:183,40653,690,24424,941,0002,992,0002,469,888
6Apr 21, 2026 07:183,44145,682,96326,204,0002,015,0002,260,992
7Apr 21, 2026 07:183,48355,603,22427,547,0001,020,0002,310,144
8Apr 21, 2026 07:183,52344,669,94425,904,0002,989,0002,453,504
9Apr 21, 2026 07:1824,464228,588,172197,613,0002,994,0002,260,992