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:10Ulyanov AlekseyUlyanov AlekseyScore: 50,468Success
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:1049,529476,879,931406,138,72502,293,760
2Jun 14, 2023 21:1050,468495,948,403413,834,85402,289,664
3Jun 14, 2023 21:1050,830476,657,848416,806,83602,179,072