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 03:31Josu San MartinJosu San MartinScore: 14,442Success
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 03:3114,373149,569,148115,863,0001,997,0002,342,912
2Dec 26, 2025 03:3114,414140,972,991116,193,0002,003,0002,342,912
3Dec 26, 2025 03:3114,422143,335,991116,253,0002,004,0002,273,280
4Dec 26, 2025 03:3114,431145,719,261115,330,0003,008,0002,273,280
5Dec 26, 2025 03:3114,442145,394,244114,409,0004,014,0002,334,720
6Dec 26, 2025 03:3114,444144,138,708116,430,0002,007,0002,273,280
7Dec 26, 2025 03:3114,461144,275,975118,578,00002,326,528
8Dec 26, 2025 03:3114,471143,804,958116,669,0001,994,0002,449,408
9Dec 26, 2025 03:3114,480144,972,033115,746,0002,993,0002,330,624