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 25, 2026 12:52Dominique GarmierDominique GarmierScore: 43,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 12:5243,521378,589,838354,877,0001,999,0002,310,144
2Mar 25, 2026 12:5243,559380,526,334356,186,0001,000,0002,277,376
3Mar 25, 2026 12:5243,590385,542,664355,445,0001,996,0002,277,376