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 listJul 8, 2025 19:59Adam FolwarcznyAdam FolwarcznyScore: 10,510Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2025 19:599,794101,208,07176,294,0004,015,0002,330,624
2Jul 8, 2025 19:5910,510113,060,41380,172,0006,012,0002,371,584
3Jul 8, 2025 19:59154,5801,294,628,3221,147,694,000119,863,0002,400,256