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 10, 2026 21:05olliecrowolliecrowScore: 15,644Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 21:0510,395106,940,03783,236,0002,005,0002,510,848
2Mar 10, 2026 21:0515,644155,340,543124,271,0004,008,0002,277,376
3Mar 10, 2026 21:0515,669160,139,456125,476,0003,011,0002,297,856