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 17, 2026 15:23Maya RebholzMaya RebholzScore: 10,418Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 15:249,67088,458,38878,283,0001,016,0002,113,536
2Jun 17, 2026 15:249,67188,603,42678,291,0001,014,0002,113,536
3Jun 17, 2026 15:249,67790,949,33478,338,0001,021,0002,113,536
4Jun 17, 2026 15:249,70288,759,45178,540,0001,018,0002,113,536
5Jun 17, 2026 15:2410,41894,648,88284,416,0001,019,0002,113,536
6Jun 17, 2026 15:2410,44395,113,09484,617,0001,017,0002,113,536
7Jun 17, 2026 15:2410,45394,955,44284,703,0001,014,0002,113,536
8Jun 17, 2026 15:2410,46395,059,53484,782,0001,016,0002,113,536
9Jun 17, 2026 15:2410,47095,546,48984,839,0001,019,0002,113,536