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 16:25Dominique GarmierDominique GarmierScore: 13,887Success
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 16:2513,717138,843,840105,510,0006,967,0002,449,408
2Mar 23, 2026 16:2513,887138,388,596107,880,0005,993,0002,347,008
3Mar 23, 2026 16:2513,959142,906,974110,444,0004,016,0002,465,792