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 6, 2026 23:26olliecrowolliecrowScore: 3,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 23:263,38954,331,09524,816,0002,977,0002,494,464
2Apr 6, 2026 23:263,39658,145,05325,856,0001,988,0002,453,504
3Apr 6, 2026 23:2622,759214,089,554183,629,0002,993,0002,502,656