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 listFeb 26, 2025 12:07Oleg KovalovOleg KovalovScore: 74,390Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2025 12:0770,593603,534,898439,898,000138,967,0002,502,656
2Feb 26, 2025 12:0774,390641,860,163468,997,000140,999,0002,424,832
3Feb 26, 2025 12:0785,399727,793,697561,414,000138,855,0002,502,656