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 16:22olliecrowolliecrowScore: 12,160Success
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 16:2212,150127,722,48397,634,0001,992,0002,482,176
2Mar 4, 2026 16:2212,160123,805,39797,716,0001,994,0002,453,504
3Mar 4, 2026 16:2212,161133,621,01197,730,0001,994,0002,412,544