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 23, 2026 14:31Dominique GarmierDominique GarmierScore: 12,552Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 14:3112,510132,995,217102,586,00002,273,280
2Mar 23, 2026 14:3112,552133,162,057100,929,0001,998,0002,392,064
3Mar 23, 2026 14:3115,402149,205,714126,300,00002,510,848