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 listFeb 7, 2026 02:46Josu San MartinJosu San MartinScore: 7,352Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 02:467,09983,596,81752,191,0006,022,0002,383,872
2Feb 7, 2026 02:467,35287,740,38954,256,0006,028,0002,383,872
3Feb 7, 2026 02:467,53584,940,18654,696,0007,090,0002,416,640