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 25, 2026 02:19Dominique GarmierDominique GarmierScore: 20,086Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 02:1919,841187,555,445157,705,0004,990,0002,519,040
2Mar 25, 2026 02:1920,086190,184,972158,719,0005,989,0002,387,968
3Mar 25, 2026 02:1920,710201,956,357167,825,0001,997,0002,469,888