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 12, 2024 07:11E SequeiraE SequeiraScore: 110,419Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2024 07:11109,099917,642,601779,661,000114,950,0002,269,184
2Nov 12, 2024 07:11110,419929,279,748790,511,000114,928,0002,334,720
3Nov 12, 2024 07:11119,2891,008,747,277861,270,000116,900,0002,330,624