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 13, 2021 18:43Yurkov AlekseyYurkov AlekseyScore: 44,518Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2021 18:4335,650366,507,562292,333,97602,301,952
2Jun 13, 2021 18:4342,374407,938,837347,464,70202,277,376
3Jun 13, 2021 18:4343,372421,408,504355,648,80602,289,664
4Jun 13, 2021 18:4344,518427,559,355365,049,79302,297,856
5Jun 13, 2021 18:4346,111446,386,934378,107,13402,293,760
6Jun 13, 2021 18:4351,987479,793,866426,297,17202,281,472