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 listApr 18, 2026 07:16olliecrowolliecrowScore: 76,047Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 07:1676,031650,026,752622,458,000999,0002,482,176
2Apr 18, 2026 07:1676,047651,314,317620,586,0002,998,0002,494,464
3Apr 18, 2026 07:1676,089650,239,793620,929,0002,999,0002,408,448