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 12:46Dominique GarmierDominique GarmierScore: 320,519Success
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 12:46320,1642,652,605,4572,623,350,0001,998,0002,351,104
2Mar 28, 2026 12:46320,5192,656,287,3472,627,260,000999,0002,375,680
3Mar 28, 2026 12:46320,5722,654,719,7342,626,689,0001,999,0002,285,568