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 listApr 26, 2026 03:40olliecrowolliecrowScore: 35,305Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 03:433,61037,868,32128,587,0001,020,0002,510,848
2Apr 26, 2026 03:433,63137,951,84527,791,0001,985,0002,469,888
3Apr 26, 2026 03:433,66038,272,74828,978,0001,034,0002,461,696
4Apr 26, 2026 03:433,72837,759,80128,533,0002,038,0002,560,000
5Apr 26, 2026 03:4335,305298,033,810284,510,0004,991,0002,330,624
6Apr 26, 2026 03:4335,327298,255,170284,694,0004,994,0002,404,352
7Apr 26, 2026 03:4335,353298,562,227284,898,0004,998,0002,412,544
8Apr 26, 2026 03:4335,378298,553,060286,100,0004,001,0002,543,616
9Apr 26, 2026 03:4335,550308,178,163286,519,0004,991,0002,379,776