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 24, 2026 06:05Dominique GarmierDominique GarmierScore: 16,836Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 06:0516,790162,241,880136,683,000997,0002,408,448
2Mar 24, 2026 06:0516,836162,500,232136,057,0002,000,0002,265,088
3Mar 24, 2026 06:0516,996166,398,581139,365,00002,494,464