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 15, 2023 10:13Ulyanov AlekseyUlyanov AlekseyScore: 28,166Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2023 10:0826,810275,554,066219,838,70902,273,280
2Jun 15, 2023 10:1326,899280,182,567220,575,03902,260,992
3Jun 15, 2023 10:0827,784295,478,827227,825,52302,277,376
4Jun 15, 2023 10:0828,166307,392,494230,958,52002,260,992
5Jun 15, 2023 10:1328,307297,208,441232,113,67602,273,280
6Jun 15, 2023 10:1328,405309,001,697232,925,08602,265,088