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 listFeb 7, 2026 04:33Josu San MartinJosu San MartinScore: 3,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 04:333,46456,722,37127,393,0001,014,0002,273,280
2Feb 7, 2026 04:333,47251,251,37428,472,00002,367,488
3Feb 7, 2026 04:3311,268120,986,64691,393,0001,004,0002,514,944