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 listDec 26, 2025 03:27Josu San MartinJosu San MartinScore: 29,127Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2025 03:2729,041263,699,052237,139,0001,000,0002,355,200
2Dec 26, 2025 03:2729,127264,661,262236,841,0001,998,0002,289,664
3Dec 26, 2025 03:2729,170271,697,859237,189,0002,001,0002,355,200