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 14:55Dominique GarmierDominique GarmierScore: 14,582Success
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 14:559,33298,531,59475,519,0001,006,0002,465,792
2Mar 24, 2026 14:5514,582149,128,320117,567,0002,009,0002,523,136
3Mar 24, 2026 14:5514,668144,957,226119,276,0001,002,0002,424,832