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 listApr 14, 2026 23:27zielajzielajScore: 5,609Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2026 23:252,92947,333,21322,016,0002,001,0002,367,488
2Apr 14, 2026 23:252,96346,240,90922,271,0002,024,0002,400,256
3Apr 14, 2026 23:275,58576,614,61843,803,0001,991,0002,486,272
4Apr 14, 2026 23:255,60970,602,95043,994,0001,999,0002,355,200
5Apr 14, 2026 23:275,61871,456,27044,066,0002,003,0002,318,336
6Apr 14, 2026 23:275,71869,023,20745,890,000997,0002,330,624