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 10, 2026 10:16Pavel SkripkinPavel SkripkinScore: 24,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:183,94346,497,90630,241,0002,095,0002,461,696
2May 10, 2026 10:183,96845,086,94930,455,0002,083,0002,457,600
3May 10, 2026 10:1824,461212,825,169197,407,0003,176,0002,355,200
4May 10, 2026 10:1824,701215,374,598200,540,0002,015,0002,367,488
5May 10, 2026 10:1824,746217,900,636199,872,0003,053,0002,359,296
6May 10, 2026 10:1824,850220,759,617201,759,0002,016,0002,527,232
7May 10, 2026 10:1825,080220,668,115202,282,0003,381,0002,539,520
8May 10, 2026 10:1825,940231,244,783209,500,0003,211,0002,367,488
9May 10, 2026 10:1826,147229,520,209212,391,0002,016,0002,371,584