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 28, 2025 19:27Adam FolwarcznyAdam FolwarcznyScore: 120,730Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2025 19:27120,7081,014,169,504868,950,000120,853,0002,490,368
2Jun 28, 2025 19:27120,7301,012,693,716867,111,000122,874,0002,306,048
3Jun 28, 2025 19:27128,1941,079,305,348941,279,000109,915,0002,289,664