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:03Ulyanov AlekseyUlyanov AlekseyScore: 49,817Success
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:0349,311471,552,341404,350,74702,285,568
2Jun 14, 2023 21:0349,817474,664,754408,502,48002,293,760
3Jun 14, 2023 21:0350,408475,487,022413,341,57502,281,472