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 23, 2026 21:39Victor MerckléVictor MerckléScore: 11,966Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 21:403,04632,703,76123,813,0001,165,0002,113,536
2Jun 23, 2026 21:403,05932,702,86623,854,0001,232,0002,113,536
3Jun 23, 2026 21:403,06032,725,06123,985,0001,110,0002,113,536
4Jun 23, 2026 21:403,06132,662,62924,002,0001,103,0002,113,536
5Jun 23, 2026 21:4011,966105,730,15597,121,0001,007,0002,113,536
6Jun 23, 2026 21:4012,022106,217,60697,568,0001,015,0002,113,536
7Jun 23, 2026 21:4012,082106,716,69098,066,0001,009,0002,113,536
8Jun 23, 2026 21:4012,563110,692,521102,011,0001,008,0002,113,536
9Jun 23, 2026 21:4012,658111,392,112102,793,0001,009,0002,113,536