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 22, 2026 02:00Victor MerckléVictor MerckléScore: 10,519Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 02:0110,44594,776,23883,629,0002,026,0002,117,632stderr
2Jun 22, 2026 02:0110,46494,872,16683,758,0002,054,0002,117,632stderr
3Jun 22, 2026 02:0110,48095,004,22083,913,0002,025,0002,117,632stderr
4Jun 22, 2026 02:0110,50795,218,58684,123,0002,040,0002,117,632stderr
5Jun 22, 2026 02:0110,51995,270,03185,245,0001,017,0002,117,632stderr
6Jun 22, 2026 02:0110,52195,307,85184,241,0002,032,0002,117,632stderr
7Jun 22, 2026 02:0110,52595,432,42384,271,0002,040,0002,117,632stderr
8Jun 22, 2026 02:0110,54095,475,07084,339,0002,089,0002,117,632stderr
9Jun 22, 2026 02:0110,63796,392,20985,050,0002,177,0002,117,632stderr