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 listJul 6, 2025 11:02Aniruddha DebAniruddha DebScore: 4,043Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2025 11:023,92952,522,99131,213,0001,006,0002,269,184
2Jul 6, 2025 11:023,96452,830,47132,501,00002,510,848
3Jul 6, 2025 11:023,97557,662,78232,593,00002,531,328
4Jul 6, 2025 11:023,98658,510,22332,682,00002,531,328
5Jul 6, 2025 11:024,01355,367,87431,909,000997,0002,510,848
6Jul 6, 2025 11:024,01557,666,91131,924,000997,0002,519,040
7Jul 6, 2025 11:024,04354,915,96832,152,0001,004,0002,531,328
8Jul 6, 2025 11:024,05055,500,68932,201,0001,006,0002,510,848
9Jul 6, 2025 11:024,05057,359,57132,202,0001,006,0002,531,328
10Jul 6, 2025 11:024,05454,265,79631,227,0002,014,0002,527,232
11Jul 6, 2025 11:024,06956,542,34333,367,00002,531,328
12Jul 6, 2025 11:024,08056,858,18733,460,00002,531,328