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 listMay 11, 2026 20:47Victor MerckléVictor MerckléScore: 9,874Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 20:489,75791,600,57578,998,0001,016,0002,117,632stderr
2May 11, 2026 20:489,79692,037,59579,313,0001,019,0002,117,632stderr
3May 11, 2026 20:489,83490,537,89578,635,0002,010,0002,117,632stderr
4May 11, 2026 20:489,85590,017,35679,798,0001,017,0002,117,632stderr
5May 11, 2026 20:489,87491,627,98879,955,0001,018,0002,117,632stderr
6May 11, 2026 20:4819,352169,573,235156,671,0002,016,0002,117,632stderr
7May 11, 2026 20:4819,811171,283,510160,448,0002,010,0002,117,632stderr
8May 11, 2026 20:4819,836171,442,232160,636,0002,020,0002,117,632stderr
9May 11, 2026 20:4819,906173,981,833161,212,0002,023,0002,117,632stderr