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 listOct 13, 2024 22:24zielajzielajScore: 8,510Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2024 22:247,81389,072,50549,054,00015,016,0002,363,392
2Oct 13, 2024 22:248,51094,873,60548,846,00020,934,0002,457,600
3Oct 13, 2024 22:248,91795,527,77563,101,00010,016,0002,498,560