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 09:09Dominique GarmierDominique GarmierScore: 15,750Success
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 09:0915,725161,342,404125,945,0002,998,0002,486,272
2Mar 24, 2026 09:0915,750157,723,169126,143,0003,003,0002,408,448
3Mar 24, 2026 09:0915,793153,117,999128,501,0001,003,0002,396,160