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 listMay 1, 2026 20:23Mehdi-Dehghan-FooladiMehdi-Dehghan-FooladiScore: 31,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 20:2431,253276,533,552254,276,0002,002,0002,338,816
2May 1, 2026 20:2431,433277,538,520254,754,0002,997,0002,519,040
3May 1, 2026 20:2431,871281,522,686259,347,0002,002,0002,527,232
4May 1, 2026 20:2431,894278,948,869259,527,0002,004,0002,523,136
5May 1, 2026 20:2431,932279,710,326259,848,0001,998,0002,523,136
6May 1, 2026 20:2432,050277,387,630259,818,0002,997,0002,531,328
7May 1, 2026 20:2432,380281,116,791263,520,0002,003,0002,502,656
8May 1, 2026 20:2432,510282,941,103263,591,0002,995,0002,523,136
9May 1, 2026 20:2435,759314,178,229290,227,0003,002,0002,338,816