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 14:08Dominique GarmierDominique GarmierScore: 165,525Success
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 14:08165,1601,382,247,7431,351,312,0002,998,0002,502,656
2Mar 28, 2026 14:08165,5251,387,954,8641,355,303,0001,998,0002,514,944
3Mar 28, 2026 14:08165,7421,384,590,5671,357,085,0001,998,0002,527,232