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 29, 2025 20:42Adam FolwarcznyAdam FolwarcznyScore: 57,874Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2025 20:4256,326486,617,447443,878,00017,995,0002,424,832
2Jun 29, 2025 20:4257,874500,491,290452,585,00021,979,0002,347,008
3Jun 29, 2025 20:4260,188525,226,733477,559,00015,985,0002,375,680