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 10:57Aniruddha DebAniruddha DebScore: 4,047Success
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 10:573,96754,071,80932,531,00002,519,040
2Jul 6, 2025 10:573,97657,679,11232,602,00002,519,040
3Jul 6, 2025 10:574,00455,861,10431,838,000994,0002,527,232
4Jul 6, 2025 10:574,03557,495,41531,083,0002,005,0002,523,136
5Jul 6, 2025 10:574,04758,284,61932,179,0001,005,0002,531,328
6Jul 6, 2025 10:574,05156,228,96832,209,0001,006,0002,510,848
7Jul 6, 2025 10:574,05458,542,13232,233,0001,007,0002,269,184
8Jul 6, 2025 10:574,06360,377,23432,305,0001,009,0002,527,232
9Jul 6, 2025 10:574,07063,483,43033,373,00002,269,184