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 listSep 19, 2026 18:27Andrew EpsteinAndrew EpsteinScore: 17,228Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 18:282,65330,544,70721,760,000020,480
2Sep 19, 2026 18:282,66830,780,30821,880,000020,480
3Sep 19, 2026 18:282,67230,703,21621,912,000020,480
4Sep 19, 2026 18:2817,155149,533,028140,678,000020,480
5Sep 19, 2026 18:2817,228150,213,017141,276,000020,480
6Sep 19, 2026 18:2817,707154,055,313145,202,000020,480
7Sep 19, 2026 18:2817,736154,262,809145,437,000020,480
8Sep 19, 2026 18:2817,755154,318,431145,594,000020,480
9Sep 19, 2026 18:2818,242158,482,046149,589,000020,480