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 listJun 22, 2025 20:46Adam FolwarcznyAdam FolwarcznyScore: 64,315Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 20:4661,951531,113,032508,002,00002,514,944
2Jun 22, 2025 20:4662,677544,780,156511,949,0001,999,0002,490,368
3Jun 22, 2025 20:4664,061554,047,786525,302,00002,502,656
4Jun 22, 2025 20:4664,095549,667,740523,578,0001,998,0002,523,136
5Jun 22, 2025 20:4664,315552,488,229526,379,0001,000,0002,514,944
6Jun 22, 2025 20:4664,518558,725,693529,051,00002,514,944
7Jun 22, 2025 20:4665,067561,070,658532,554,000999,0002,514,944
8Jun 22, 2025 20:4665,099561,448,394531,809,0001,999,0002,514,944
9Jun 22, 2025 20:4667,390579,216,201551,599,000999,0002,514,944