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 listDec 26, 2025 04:10Josu San MartinJosu San MartinScore: 41,120Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2025 04:1040,717357,844,199160,942,000172,938,0002,457,600
2Dec 26, 2025 04:1041,120362,363,944160,086,000177,095,0002,318,336
3Dec 26, 2025 04:1041,746368,623,679165,669,000176,647,0002,310,144