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 22, 2026 10:11Dominique GarmierDominique GarmierScore: 66,457Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 10:1166,262566,989,905541,347,0002,001,0002,531,328
2Mar 22, 2026 10:1166,457569,090,422542,951,0001,999,0002,478,080
3Mar 22, 2026 10:1168,763588,761,740561,860,0001,995,0002,523,136