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 10:19Valentin KofmanValentin KofmanScore: 6,997Success
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 10:196,90183,067,74736,381,00020,211,0002,293,760
2Jul 11, 2025 10:196,99782,114,96844,292,00013,086,0002,506,752
3Jul 11, 2025 10:197,05784,665,75840,907,00016,961,0002,383,872