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 27, 2026 14:50Dominique GarmierDominique GarmierScore: 18,016Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 14:5017,983178,859,969147,460,00002,412,544
2Mar 27, 2026 14:5018,016174,612,908146,733,000998,0002,347,008
3Mar 27, 2026 14:5018,024176,564,875144,800,0002,995,0002,400,256