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 listMar 25, 2026 08:24Dominique GarmierDominique GarmierScore: 10,334Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 08:2410,251106,725,02183,062,0001,000,0002,453,504
2Mar 25, 2026 08:2410,334112,541,70081,745,0002,990,0002,314,240
3Mar 25, 2026 08:2410,424110,295,90384,470,0001,005,0002,367,488