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 2, 2026 10:45C#_userC#_userScore: 125,555Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 10:5191,598760,908,546617,877,000133,230,0002,134,016
2Sep 2, 2026 10:5193,113773,276,360629,284,000134,245,0002,150,400
3Sep 2, 2026 10:51103,221856,163,243712,253,000134,161,0002,199,552
4Sep 2, 2026 10:51119,309988,250,151843,766,000134,574,0002,154,496
5Sep 2, 2026 10:51125,5551,039,348,137895,535,000134,017,0002,150,400
6Sep 2, 2026 10:51127,0661,051,698,492908,801,000133,145,0002,150,400
7Sep 2, 2026 10:51133,7241,106,364,057963,774,000132,767,0002,150,400
8Sep 2, 2026 10:51140,9771,165,948,9481,022,801,000133,218,0002,150,400
9Sep 2, 2026 10:51145,0141,198,959,9801,055,813,000133,306,0002,150,400