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 listSep 3, 2026 05:12Josu San MartinJosu San MartinScore: 3,599Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 05:133,56239,193,36628,156,0001,059,0002,113,536
2Sep 3, 2026 05:133,58840,250,36828,397,0001,032,0002,113,536
3Sep 3, 2026 05:133,58839,467,60828,368,0001,056,0002,113,536
4Sep 3, 2026 05:133,59440,296,32728,415,0001,061,0002,113,536
5Sep 3, 2026 05:133,59939,554,05128,451,0001,068,0002,113,536
6Sep 3, 2026 05:139,66390,409,46874,816,0004,421,0002,113,536
7Sep 3, 2026 05:1310,78499,289,86983,031,0005,405,0002,113,536
8Sep 3, 2026 05:1311,337103,069,23486,540,0006,426,0002,113,536
9Sep 3, 2026 05:1317,507154,361,698137,205,0006,359,0002,117,632