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 listJul 9, 2025 19:36Valentin KofmanValentin KofmanScore: 7,167Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2025 19:406,95079,653,12439,995,00016,998,0002,269,184
2Jul 9, 2025 19:366,99179,601,32243,249,00014,081,0002,367,488
3Jul 9, 2025 19:407,01787,820,76439,369,00018,170,0002,498,560
4Jul 9, 2025 19:367,16785,008,28047,814,00010,957,0002,273,280
5Jul 9, 2025 19:407,17984,471,36739,908,00018,956,0002,514,944
6Jul 9, 2025 19:367,27584,276,02245,500,00014,155,0002,486,272