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 listFeb 17, 2024 01:07Huy Duc LeHuy Duc LeScore: 1,000,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2024 01:07998,6488,248,518,9568,188,916,27902,289,664
2Feb 17, 2024 01:071,000,3968,262,512,2178,203,251,03002,289,664
3Feb 17, 2024 01:071,000,8958,269,433,7738,207,337,93602,293,760