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 listMay 7, 2024 13:19dpetruciidpetruciiScore: 1,503,128Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2024 13:191,486,78712,256,110,93912,191,649,35602,248,704
2May 7, 2024 13:191,503,12812,379,525,73512,325,651,12802,232,320
3May 7, 2024 13:191,519,49212,524,123,55312,459,833,10502,371,584