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 11, 2025 19:13Valentin KofmanValentin KofmanScore: 7,018Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 11, 2025 19:176,44876,396,58234,914,00017,956,0002,310,144
2Jul 11, 2025 19:136,73876,210,29737,169,00018,082,0002,383,872
3Jul 11, 2025 19:176,77082,552,81140,377,00015,141,0002,289,664
4Jul 11, 2025 19:137,01887,898,75641,393,00016,153,0002,404,352
5Jul 11, 2025 19:137,04783,950,83838,855,00018,929,0002,510,848
6Jul 11, 2025 19:177,63190,617,89640,373,00022,205,0002,510,848