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 listDec 25, 2024 03:30Joad NacerJoad NacerScore: 4,012Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 25, 2024 03:303,98854,052,38731,681,0001,021,0002,396,160
2Dec 25, 2024 03:304,01253,464,39630,902,0001,993,0002,482,176
3Dec 25, 2024 03:304,05454,782,05231,225,0002,014,0002,510,848