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 31, 2021 22:19Prisyazhnyuk AlexanderPrisyazhnyuk AlexanderScore: 1,253,927Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2021 22:191,246,16310,280,448,09110,218,534,12802,203,648
2Jul 31, 2021 22:191,253,92710,380,160,06710,282,200,18102,207,744
3Jul 31, 2021 22:191,255,75810,346,822,28610,297,214,87002,211,840