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:30Josu San MartinJosu San MartinScore: 11,953Success
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:3011,949126,420,61695,982,0001,999,0002,506,752
2Jan 18, 2026 04:3011,953121,232,95295,017,0003,000,0002,453,504
3Jan 18, 2026 04:3011,985119,757,11196,268,0002,005,0002,461,696