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 15, 2026 21:29zielajzielajScore: 2,851Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2026 21:292,84343,981,86321,286,0002,027,0002,322,432
2Apr 15, 2026 21:292,85147,093,25522,364,0001,016,0002,453,504
3Apr 15, 2026 21:292,91055,219,57120,883,0002,983,0002,326,528