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 22:14Dominique GarmierDominique GarmierScore: 29,555Success
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 22:1429,368271,417,203238,818,0001,998,0002,273,280
2Mar 21, 2026 22:1429,555263,133,937241,353,0001,001,0002,269,184
3Mar 21, 2026 22:1429,659264,164,881241,199,0002,001,0002,531,328