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 21, 2023 10:32Oleg KovalovOleg KovalovScore: 959,225Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2023 10:32957,6397,957,542,7437,852,641,38902,293,760
2Dec 21, 2023 10:32959,2257,932,226,2537,865,648,75302,277,376
3Dec 21, 2023 10:32963,6617,966,773,2937,902,023,06502,277,376