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 listApr 25, 2023 19:31Franek KortaFranek KortaScore: 11,814Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2023 19:3111,684151,600,32495,810,71302,240,512
2Apr 25, 2023 19:3111,814159,171,74696,878,17002,179,072
3Apr 25, 2023 19:3112,331161,521,663101,113,65702,236,416