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 26, 2026 21:23Dominique GarmierDominique GarmierScore: 9,385Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 21:239,337106,128,64874,548,0002,014,0002,437,120
2Mar 26, 2026 21:239,385100,852,59472,958,0003,997,0002,310,144
3Mar 26, 2026 21:239,443104,613,02975,423,0002,011,0002,424,832