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 listJul 13, 2023 08:57gchebanovgchebanovScore: 1,816,049Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2023 08:571,812,27414,916,275,61714,860,645,16002,318,336
2Jul 13, 2023 08:571,816,04914,977,486,05414,891,599,86502,199,552
3Jul 13, 2023 08:571,822,48915,021,461,45814,944,408,59202,314,240