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 00:03Valentin KofmanValentin KofmanScore: 7,103Success
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 00:037,05283,192,25537,889,00019,941,0002,334,720
2Jul 9, 2025 00:037,10382,183,65435,149,00023,098,0002,392,064
3Jul 9, 2025 00:037,20481,548,45741,051,00018,022,0002,473,984