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 24, 2026 23:48Dominique GarmierDominique GarmierScore: 18,737Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 23:4818,697179,916,86860,123,00093,191,0002,342,912
2Mar 24, 2026 23:4818,737180,253,59264,848,00088,792,0002,297,856
3Mar 24, 2026 23:4818,760178,964,02455,940,00097,895,0002,367,488