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:20Ulyanov AlekseyUlyanov AlekseyScore: 30,623Success
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:2030,396310,689,569249,245,03302,269,184
2Jun 14, 2023 21:2030,623323,372,228251,111,64302,260,992
3Jun 14, 2023 21:2030,896311,280,584253,346,42402,265,088