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 listJan 7, 2026 10:21Rajarshi BasuRajarshi BasuScore: 4,733Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 10:214,34261,518,54128,486,0007,121,0002,412,544
2Jan 7, 2026 10:214,65565,198,70734,157,0004,018,0002,412,544
3Jan 7, 2026 10:214,68763,090,29336,410,0002,022,0002,514,944
4Jan 7, 2026 10:214,73367,292,87135,827,0002,985,0002,408,448
5Jan 7, 2026 10:214,73365,446,29136,823,0001,990,0002,494,464
6Jan 7, 2026 10:215,04367,491,24837,320,0004,034,0002,400,256
7Jan 7, 2026 10:2172,345621,682,047462,399,000130,830,0002,469,888
8Jan 7, 2026 10:2174,605633,853,395484,811,000126,950,0002,338,816
9Jan 7, 2026 10:2174,983640,579,507486,098,000128,761,0002,523,136