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 listJan 18, 2026 07:07Josu San MartinJosu San MartinScore: 8,104Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 07:078,09293,988,31163,340,0003,016,0002,510,848
2Jan 18, 2026 07:078,10489,360,95065,448,0001,006,0002,461,696
3Jan 18, 2026 07:078,12492,729,96565,610,0001,009,0002,351,104