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 20, 2026 02:32Dominique GarmierDominique GarmierScore: 12,902Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 02:3212,871135,372,448104,541,0001,005,0002,297,856
2Mar 20, 2026 02:3212,902132,175,581103,804,0001,996,0002,273,280
3Mar 20, 2026 02:3212,905132,403,192103,823,0001,996,0002,322,432