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 21, 2026 11:39Dominique GarmierDominique GarmierScore: 13,007Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 11:3912,990130,814,240106,520,00002,445,312
2Mar 21, 2026 11:3913,007132,066,578105,662,000996,0002,523,136
3Mar 21, 2026 11:3913,016137,384,109103,742,0002,992,0002,277,376