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 19, 2026 00:21Dominique GarmierDominique GarmierScore: 20,627Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 00:2120,230193,814,533162,891,0002,998,0002,445,312
2Mar 19, 2026 00:2120,627196,908,587167,141,0002,001,0002,461,696
3Mar 19, 2026 00:2120,840198,691,075169,885,000999,0002,457,600