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 22, 2026 18:49izotoffizotoffScore: 112,232Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 18:4998,840838,878,872630,822,000179,664,0002,318,336
2Mar 22, 2026 18:49112,232947,692,502743,440,000176,866,0002,457,600
3Mar 22, 2026 18:49138,2791,161,572,511955,062,000178,824,0002,281,472