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 listJul 31, 2021 22:47Mikhail ShirokovMikhail ShirokovScore: 113,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2021 15:3792,398815,405,279757,660,74702,301,952
2Jul 21, 2021 16:02107,367943,427,528880,413,07402,285,568
3Jul 21, 2021 15:37112,041987,354,759918,732,88102,289,664
4Jul 21, 2021 16:02112,144983,926,380919,580,01602,281,472
5Jul 31, 2021 22:47113,003997,348,646926,624,43902,277,376
6Jul 21, 2021 16:02114,108997,387,114935,687,93102,281,472
7Jul 21, 2021 15:37115,9911,009,460,162951,123,04002,285,568
8Jul 31, 2021 22:47127,8001,105,892,0371,047,960,43002,310,144
9Jul 31, 2021 22:47133,7781,157,344,4221,096,976,25802,244,608