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 listNov 12, 2025 21:04izotoffizotoffScore: 101,029Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2025 21:0495,612813,370,917596,017,000188,005,0002,314,240
2Nov 12, 2025 21:04101,029860,168,758655,555,000172,882,0002,449,408
3Nov 12, 2025 21:04157,0491,316,292,7051,099,978,000187,825,0002,277,376