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:45Adam FolwarcznyAdam FolwarcznyScore: 65,477Success
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:4560,995525,054,994499,155,0001,000,0002,523,136
2Jun 22, 2025 20:4564,102550,416,727523,635,0001,998,0002,387,968
3Jun 22, 2025 20:4564,502558,098,487526,915,0001,999,0002,514,944
4Jun 22, 2025 20:4565,312560,905,258533,558,0001,998,0002,523,136
5Jun 22, 2025 20:4565,477560,050,067535,915,000999,0002,514,944
6Jun 22, 2025 20:4566,255572,681,687542,291,0001,000,0002,387,968
7Jun 22, 2025 20:4567,122578,109,652549,399,0001,000,0002,383,872
8Jun 22, 2025 20:4567,454575,862,956553,125,00002,383,872
9Jun 22, 2025 20:4567,472582,213,285551,275,0001,997,0002,514,944