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:31Adam FolwarcznyAdam FolwarcznyScore: 113,252Success
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:31106,716900,434,153766,188,000108,884,0002,277,376
2Jun 28, 2025 19:31113,252963,414,568821,702,000106,961,0002,322,432
3Jun 28, 2025 19:31144,0101,205,219,1781,058,999,000121,884,0002,297,856