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 listJul 8, 2025 19:51Adam FolwarcznyAdam FolwarcznyScore: 110,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2025 19:516,98678,370,09053,266,0004,020,0002,461,696
2Jul 8, 2025 19:517,11082,138,00555,283,0003,015,0002,465,792
3Jul 8, 2025 19:51105,329900,000,449747,740,000115,959,0002,293,760
4Jul 8, 2025 19:51110,159925,338,665793,388,000109,915,0002,338,816
5Jul 8, 2025 19:51124,7691,050,196,137911,202,000111,902,0002,297,856
6Jul 8, 2025 19:51133,4141,116,650,698981,100,000112,896,0002,330,624