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 16, 2026 00:16zielajzielajScore: 2,851Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 00:122,79747,378,64220,945,0001,994,0002,486,272
2Apr 16, 2026 00:122,80045,099,02021,960,000998,0002,514,944
3Apr 16, 2026 00:122,81050,854,27122,040,0001,001,0002,318,336
4Apr 16, 2026 00:122,81642,209,27922,086,0001,003,0002,338,816
5Apr 16, 2026 00:122,81847,345,05021,095,0002,009,0002,375,680
6Apr 16, 2026 00:122,82144,479,62121,118,0002,011,0002,437,120
7Apr 16, 2026 00:162,85145,938,48822,361,0001,016,0002,367,488
8Apr 16, 2026 00:125,32074,515,00842,612,0001,014,0002,494,464
9Apr 16, 2026 00:165,34067,840,44443,790,00002,457,600
10Apr 16, 2026 00:165,34865,174,46341,863,0001,993,0002,473,984
11Apr 16, 2026 00:125,38471,851,29443,143,0001,003,0002,420,736
12Apr 16, 2026 00:128,43890,053,83668,188,0001,002,0002,297,856