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 21, 2026 22:25Dominique GarmierDominique GarmierScore: 13,160Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 22:2513,083136,927,810106,282,0001,002,0002,494,464
2Mar 21, 2026 22:2513,160136,413,438106,916,000999,0002,408,448
3Mar 21, 2026 22:2513,357136,876,495108,524,0001,004,0002,351,104