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 20, 2026 16:18BenBenScore: 33,180Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 16:2032,923295,381,61299,991,000169,984,0002,424,832
2Apr 20, 2026 16:2033,180301,570,140101,029,000171,049,0002,351,104
3Apr 20, 2026 16:2033,629298,135,530100,914,000174,851,0002,433,024