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 23, 2026 07:21Dominique GarmierDominique GarmierScore: 11,597Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 07:2111,583125,883,97292,979,0001,999,0002,420,736
2Mar 23, 2026 07:2111,597120,941,21592,096,0003,003,0002,355,200
3Mar 23, 2026 07:2112,101124,720,14299,232,00002,293,760