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:16C#_userC#_userScore: 109,667Success
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:2089,065740,096,507576,519,000153,814,0002,150,400
2Sep 2, 2026 10:2097,421812,716,521646,202,000152,651,0002,150,400
3Sep 2, 2026 10:2098,066813,925,666650,030,000154,113,0002,150,400
4Sep 2, 2026 10:20104,462866,499,595703,145,000153,444,0002,150,400
5Sep 2, 2026 10:20109,667908,976,878745,999,000153,271,0002,199,552
6Sep 2, 2026 10:20114,493948,633,942784,529,000154,314,0002,199,552
7Sep 2, 2026 10:20118,033980,286,678815,810,000152,063,0002,121,728
8Sep 2, 2026 10:20120,536998,170,360836,413,000151,990,0002,150,400
9Sep 2, 2026 10:20126,1391,047,255,401880,133,000154,208,0002,150,400