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 26, 2026 18:36Kevin HeaveyKevin HeaveyScore: 2,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 18:372,50029,383,56520,502,000020,480
2Sep 26, 2026 18:372,50429,492,14320,538,000020,480
3Sep 26, 2026 18:372,50529,981,38020,541,000020,480
4Sep 26, 2026 18:372,50729,412,53520,561,000020,480
5Sep 26, 2026 18:372,50829,586,44820,568,000020,480
6Sep 26, 2026 18:372,51830,111,28019,595,0001,054,00020,480
7Sep 26, 2026 18:375,66555,297,40444,433,0002,024,00020,480
8Sep 26, 2026 18:375,67455,412,06444,323,0002,206,00020,480
9Sep 26, 2026 18:375,90157,876,36846,365,0002,028,00020,480