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 01:25Josu San MartinJosu San MartinScore: 29,674Success
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 01:2528,652265,756,630233,944,000999,0002,367,488
2Dec 26, 2025 01:2528,954265,044,839236,424,0001,001,0002,355,200
3Dec 26, 2025 01:2529,374262,317,108237,869,0002,998,0002,428,928
4Dec 26, 2025 01:2529,673267,962,986243,321,00002,355,200
5Dec 26, 2025 01:2529,674273,725,712242,323,0001,001,0002,289,664
6Dec 26, 2025 01:2529,805268,551,516244,405,00002,359,296
7Dec 26, 2025 01:2529,839277,880,901243,680,000998,0002,351,104
8Dec 26, 2025 01:2529,845273,313,469242,729,0001,997,0002,359,296
9Dec 26, 2025 01:2529,953272,773,944243,615,0001,996,0002,363,392