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 1, 2026 17:53Mehdi-Dehghan-FooladiMehdi-Dehghan-FooladiScore: 32,013Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 17:5431,330275,048,574253,908,0002,998,0002,519,040
2May 1, 2026 17:5431,433285,024,327254,755,0002,997,0002,519,040
3May 1, 2026 17:5431,650283,266,137257,529,0002,004,0002,514,944
4May 1, 2026 17:5431,863277,969,969260,280,0001,001,0002,531,328
5May 1, 2026 17:5432,013285,232,955260,504,0002,003,0002,523,136
6May 1, 2026 17:5432,268278,568,456263,602,0001,002,0002,318,336
7May 1, 2026 17:5432,299282,528,975261,860,0002,998,0002,334,720
8May 1, 2026 17:5432,329285,823,589262,102,0003,001,0002,519,040
9May 1, 2026 17:5432,755289,058,235265,601,0002,995,0002,519,040