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 04:25Josu San MartinJosu San MartinScore: 9,146Success
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 04:259,141103,961,02671,955,0002,998,0002,322,432
2Jan 18, 2026 04:259,14695,915,16873,998,000999,0002,437,120
3Jan 18, 2026 04:259,14997,327,65872,019,0003,000,0002,449,408