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 listJun 14, 2023 21:18Ulyanov AlekseyUlyanov AlekseyScore: 29,625Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2023 21:1829,366302,846,835240,798,87702,273,280
2Jun 14, 2023 21:1829,625300,640,431242,924,12502,260,992
3Jun 14, 2023 21:1832,624340,241,461267,518,71702,252,800