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 listMar 20, 2026 04:23olliecrowolliecrowScore: 3,467Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 04:233,43855,612,19225,171,0003,020,0002,338,816
2Mar 20, 2026 04:233,46749,408,30828,426,00002,486,272
3Mar 20, 2026 04:233,55054,679,66228,106,0001,003,0002,383,872