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 listNov 20, 2024 16:48Joad NacerJoad NacerScore: 6,542Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2024 16:486,27671,544,39149,443,0002,018,0002,420,736
2Nov 20, 2024 16:486,54281,558,44351,623,0002,024,0002,277,376
3Nov 20, 2024 16:487,18181,901,15557,885,000998,0002,539,520