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 22:27Victor MerckléVictor MerckléScore: 10,545Success
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 22:2810,43494,572,49884,543,0001,019,0002,117,632stderr
2Jun 22, 2026 22:2810,44294,669,14483,593,0002,037,0002,117,632stderr
3Jun 22, 2026 22:2810,51695,303,51984,205,0002,028,0002,117,632stderr
4Jun 22, 2026 22:2810,51895,478,40384,233,0002,021,0002,117,632stderr
5Jun 22, 2026 22:2810,54595,532,72084,464,0002,007,0002,117,632stderr
6Jun 22, 2026 22:2810,55395,644,11284,476,0002,066,0002,117,632stderr
7Jun 22, 2026 22:2810,56295,706,03084,602,0002,012,0002,117,632stderr
8Jun 22, 2026 22:2810,59895,951,63185,892,0001,013,0002,117,632stderr
9Jun 22, 2026 22:2810,60096,036,11484,867,0002,059,0002,117,632stderr