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 listNov 27, 2022 14:43Vlad ShcherbinaVlad ShcherbinaScore: 31,182Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 27, 2022 14:4330,180311,212,946247,473,67202,211,840
2Nov 27, 2022 14:4331,182313,421,509255,694,95402,203,648
3Nov 27, 2022 14:4331,766320,901,607260,482,08602,207,744