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 31, 2025 08:17Rajarshi BasuRajarshi BasuScore: 10,082Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 08:1710,055104,814,56180,443,0002,011,0002,506,752
2Dec 31, 2025 08:1710,065107,258,91682,535,00002,510,848
3Dec 31, 2025 08:1710,069113,151,71281,562,0001,006,0002,519,040
4Dec 31, 2025 08:1710,073109,167,13980,584,0002,014,0002,342,912
5Dec 31, 2025 08:1710,082109,659,34479,681,0002,988,0002,326,528
6Dec 31, 2025 08:1710,087110,546,28379,726,0002,989,0002,326,528
7Dec 31, 2025 08:1710,097116,230,40980,803,0001,995,0002,285,568
8Dec 31, 2025 08:1710,108106,420,66980,889,0001,997,0002,326,528
9Dec 31, 2025 08:1710,124110,596,33582,014,0001,000,0002,326,528