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 21:37Mehdi-Dehghan-FooladiMehdi-Dehghan-FooladiScore: 22,740Success
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 21:3822,265199,905,599179,587,0002,993,0002,531,328
2May 1, 2026 21:3822,485202,331,778182,381,0002,004,0002,519,040
3May 1, 2026 21:3822,494203,664,099181,463,0002,991,0002,519,040
4May 1, 2026 21:3822,678203,858,786182,961,0002,999,0002,527,232
5May 1, 2026 21:3822,740208,807,065184,470,0002,005,0002,523,136
6May 1, 2026 21:3822,967206,101,004187,326,0001,007,0002,514,944
7May 1, 2026 21:3822,970205,196,894185,365,0002,989,0002,334,720
8May 1, 2026 21:3823,022211,243,622185,788,0002,996,0002,338,816
9May 1, 2026 21:3823,322208,947,521188,243,0003,003,0002,314,240