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:53gchebanovgchebanovScore: 1,343,190Success
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:531,331,91410,994,051,22610,921,691,38702,289,664
2Jul 13, 2023 08:531,343,19011,074,851,43911,014,155,80102,297,856
3Jul 13, 2023 08:531,346,15011,096,749,80111,038,431,46302,281,472