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 19, 2025 22:06Adam FolwarcznyAdam FolwarcznyScore: 91,911Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2025 22:0681,219696,095,355547,998,000117,999,0002,461,696
2Jun 19, 2025 22:0691,911775,872,062644,716,000108,952,0002,322,432
3Jun 19, 2025 22:06110,055924,376,133783,520,000118,927,0002,416,640