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 19, 2026 01:35zielajzielajScore: 2,787Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 01:352,78749,574,58821,860,000993,0002,473,984
2Apr 19, 2026 01:352,78751,092,20820,868,0001,987,0002,301,952
3Apr 19, 2026 01:352,78750,212,20321,864,000993,0002,478,080