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 19:23izotoffizotoffScore: 118,710Success
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 19:23103,097868,543,505664,527,000180,871,0002,297,856
2Mar 22, 2026 19:23118,710994,314,165794,347,000179,078,0002,478,080
3Mar 22, 2026 19:23141,1431,194,180,674963,810,000193,560,0002,383,872