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:32Adam FolwarcznyAdam FolwarcznyScore: 122,244Success
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:3288,927756,232,152617,322,000111,877,0002,482,176
2Jun 28, 2025 19:32122,2441,026,452,722882,471,000119,928,0002,383,872
3Jun 28, 2025 19:32157,3501,320,242,8601,180,336,000109,938,0002,412,544