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:46Adam FolwarcznyAdam FolwarcznyScore: 69,462Success
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:4668,065579,366,374535,127,00023,005,0002,396,160
2Jun 28, 2025 19:4669,462591,590,490550,604,00018,986,0002,510,848
3Jun 28, 2025 19:4672,383617,149,968564,567,00028,977,0002,396,160