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 04:00Yuriy LyfenkoYuriy LyfenkoScore: 4,539Success
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 04:004,53162,267,79435,145,0002,008,0002,494,464
2Apr 14, 2026 04:004,53961,732,88131,185,0006,035,0002,404,352
3Apr 14, 2026 04:004,62763,530,21733,948,0003,993,0002,338,816