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 28, 2026 19:00Dominique GarmierDominique GarmierScore: 10,232Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 19:0010,161105,828,25181,317,0002,007,0002,408,448
2Mar 28, 2026 19:0010,232110,150,71880,906,0002,996,0002,338,816
3Mar 28, 2026 19:0010,250110,003,15782,053,0002,001,0002,301,952