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 10:05Valentin KofmanValentin KofmanScore: 7,247Success
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 10:057,07881,699,76936,022,00022,014,0002,351,104
2Jul 9, 2025 10:057,24780,767,90541,298,00018,131,0002,396,160
3Jul 9, 2025 10:057,29683,671,86744,615,00015,209,0002,494,464