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 4, 2026 00:42olliecrowolliecrowScore: 12,415Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 00:4212,395133,251,830100,646,000996,0002,396,160
2Mar 4, 2026 00:4212,415129,131,31298,806,0002,994,0002,347,008
3Mar 4, 2026 00:4212,497129,274,318100,469,0002,009,0002,453,504