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 listAug 20, 2024 21:35Jatin YadavJatin YadavScore: 127,927Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 20, 2024 21:35114,358997,947,657937,737,02002,297,856
2Aug 20, 2024 21:35127,9271,110,554,2631,049,003,97702,297,856
3Aug 20, 2024 21:35147,7211,271,480,5351,211,316,07802,297,856