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 listJun 12, 2026 10:43Victor MerckléVictor MerckléScore: 3,433Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 10:433,34835,414,93826,414,0001,045,0002,113,536
2Jun 12, 2026 10:433,37235,023,48626,623,0001,029,0002,113,536
3Jun 12, 2026 10:433,38935,713,32126,743,0001,054,0002,113,536
4Jun 12, 2026 10:433,42535,839,72227,056,0001,035,0002,113,536
5Jun 12, 2026 10:433,43336,040,03827,103,0001,048,0002,113,536
6Jun 12, 2026 10:433,44735,631,41027,235,0001,035,0002,113,536
7Jun 12, 2026 10:433,47935,921,04027,472,0001,062,0002,113,536
8Jun 12, 2026 10:433,52337,943,74727,857,0001,035,0002,113,536
9Jun 12, 2026 10:4312,835113,194,676102,999,0002,255,0002,113,536