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 03:56Josu San MartinJosu San MartinScore: 3,494Success
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 03:563,41056,965,35325,965,0001,997,0002,420,736
2Feb 7, 2026 03:563,49454,489,98428,647,00002,453,504
3Feb 7, 2026 03:5611,303119,081,15889,694,0002,989,0002,314,240