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 listApr 14, 2026 02:31Yuriy LyfenkoYuriy LyfenkoScore: 3,948Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2026 02:313,91657,107,72629,102,0003,010,0002,412,544
2Apr 14, 2026 02:313,94858,354,02628,325,0004,046,0002,359,296
3Apr 14, 2026 02:313,95464,017,71628,372,0004,053,0002,351,104