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 24, 2026 08:06Kevin HeaveyKevin HeaveyScore: 2,552Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 08:072,53829,524,56819,781,0001,034,00020,480
2Sep 24, 2026 08:072,54129,435,56719,801,0001,038,00020,480
3Sep 24, 2026 08:072,54929,571,00919,897,0001,007,00020,480
4Sep 24, 2026 08:072,55029,584,46519,882,0001,034,00020,480
5Sep 24, 2026 08:072,55229,548,97919,911,0001,019,00020,480
6Sep 24, 2026 08:072,55729,780,74719,902,0001,071,00020,480
7Sep 24, 2026 08:072,55929,613,26019,953,0001,036,00020,480
8Sep 24, 2026 08:072,56130,492,31019,961,0001,041,00020,480
9Sep 24, 2026 08:072,56230,221,42520,010,0001,004,00020,480