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 listJun 17, 2026 15:27Maya RebholzMaya RebholzScore: 9,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 15:289,64388,729,85078,050,0001,028,0002,113,536
2Jun 17, 2026 15:289,64788,756,01578,084,0001,022,0002,113,536
3Jun 17, 2026 15:289,68389,072,78178,375,0001,027,0002,113,536
4Jun 17, 2026 15:289,70089,199,57178,502,0001,044,0002,113,536
5Jun 17, 2026 15:289,70589,098,68878,552,0001,032,0002,113,536
6Jun 17, 2026 15:2810,40994,651,39384,341,0001,013,0002,113,536
7Jun 17, 2026 15:2810,42095,302,32884,424,0001,020,0002,113,536
8Jun 17, 2026 15:2810,42395,199,32384,443,0001,029,0002,113,536
9Jun 17, 2026 15:2810,73897,673,44986,989,0001,067,0002,113,536