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 19:11Dominique GarmierDominique GarmierScore: 16,299Success
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 19:1116,238155,894,855133,150,00002,355,200
2Mar 24, 2026 19:1116,299166,683,269132,655,000997,0002,359,296
3Mar 24, 2026 19:1116,433165,552,556133,749,000998,0002,359,296