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 23:49zielajzielajScore: 5,465Success
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 23:492,86846,608,51723,518,00002,494,464
2Apr 14, 2026 23:495,46575,660,59043,815,000995,0002,482,176
3Apr 14, 2026 23:495,48368,890,26042,965,0001,998,0002,285,568