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 listAug 18, 2026 07:14Josu San MartinJosu San MartinScore: 8,056Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 07:187,98273,649,98263,230,0002,226,0002,125,824
2Aug 18, 2026 07:187,99073,717,71063,225,0002,300,0002,125,824
3Aug 18, 2026 07:188,01573,833,84863,613,0002,113,0002,125,824
4Aug 18, 2026 07:188,03374,160,19463,719,0002,154,0002,125,824
5Aug 18, 2026 07:188,05674,276,15163,749,0002,315,0002,125,824
6Aug 18, 2026 07:1815,999139,426,184129,049,0002,147,0002,125,824
7Aug 18, 2026 07:1816,062141,501,336129,571,0002,139,0002,125,824
8Aug 18, 2026 07:1816,107140,255,397129,937,0002,143,0002,125,824
9Aug 18, 2026 07:1816,134145,222,549130,093,0002,207,0002,125,824