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 17, 2023 09:09Kenneth MaplesKenneth MaplesScore: 6,054Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 17, 2023 09:096,043126,176,53549,551,03502,260,992
2Dec 17, 2023 09:096,054116,830,72649,642,77002,191,360
3Dec 17, 2023 09:096,148112,421,59850,414,66702,256,896